Multiple choice technology programming languages

Would you rather wait for the results of a quicksort, a linear search, or a bubble sort on a 200000 element array?

  1. Quicksort

  2. Linear Search

  3. Bubble Sort

  4. none of the above
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

For 200,000 elements: Quicksort is O(n log n) ≈ 3.6M operations, Linear Search is O(n) = 200K operations, and Bubble Sort is O(n²) = 40B operations. Linear search is fastest, so you'd wait the least time for it.

Keep practicing — related questions