Big O notation made Simple

O(1)

O(n)

O(n²)

O(log n)

O(log n) is better for large n value

Sorting something that you will never search is a complete waste, searching something you never sorted is merely inefficient.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store