35 likes

·

1.2K reads

## 2 comments

·Sep 21, 2023

Sep 21, 2023

Great explanation of O(log n)! I especially liked the analogy with guessing a number.

Can you expand on how O(log n) compares to other time complexities like O(n) or O(n^2) in terms of efficiency, and which is best for which types of problems? I think this can help a lot of beginner developers compare all options and gain a bit more insight.

19

·

·Sep 21, 2023

Sep 21, 2023

Straight to the point!🚀

1

·