Big O Cheat Codes

1) Insertion sort executes in O(N*N), but it is twice as fast as bubble sort and faster than selection sort.

2) Time complexity/Big O for binary search is O(LogN)