What is big O of log 2n?

What is big O of log 2n? 2 Answers. This is O(log_2 n) . What is the complexity of n log n? O(nlogn) implies that logn operations will occur n times. O(nlogn) time is common in recursive sorting algorithms, sorting algorithms using a binary tree sort and most other types of sorts. The above quicksort […]

Back to Top