FAQs

Different Types of Big O

O(1)

• Constant Time

• An operation which is done to reach an element directly (like a dictionary or hash table)

O(n)

First we would have to search it by checking n elements

O(log n)

Sources

• https://hackernoon.com/what-does-the-time-complexity-o-log-n-actually-mean-45f94bb5bfbf

• https://stackoverflow.com/questions/2307283/what-does-olog-n-mean-exactly

• https://stackoverflow.com/questions/10369563/difference-between-on-and-ologn-which-is-better-and-what-exactly-is-olo

In-place Algorithm

An algorithm which transform input with no auxilary data structure. The input is usually overwritten by the output as the algorithm executes. In place algorithm updates input sequence only through replacement or swapping of elements.