Are there are any cases where you would prefer O(log n) time complexity to O(1) time complexity? Or O(n) to O(log n)?
Do you have any examples?
-
1010 Avenue of the Moon
New York, NY 10018 US. -
Mon - Sat 8.00 - 18.00
Sunday: Closed - Get A Quote
Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?
- IT Nursery
- May 22, 2022
- 0