Question: Let's compare linear search and binary search. What are the Big-O of each? Linear Search is linear ( i.e. O(n) ), and Binary Search is
Let's compare linear search and binary search. What are the Big-O of each?
| Linear Search is linear ( i.e. O(n) ), and Binary Search is log linear ( i.e. O(n log n ) ) | ||
| Linear Search is linear ( i.e. O(n) ), and Binary Search is also linear ( i.e. O(n) ) | ||
| Linear Search is linear ( i.e. O(n) ), and Binary Search is log ( i.e. O(log n) ) | ||
| Linear Search is quadratic ( i.e. O(n^2) ), and Binary Search is log linear ( i.e. O( n log n) ) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
