Question: True/False Circle one. Explain your answers. 1. (T/F) The best case complexity of BUBBLE SORT is O(n) 2. (T/F) The best case complexity of INSERTION
True/False Circle one. Explain your answers. 1. (T/F) The best case complexity of BUBBLE SORT is O(n) 2. (T/F) The best case complexity of INSERTION SORT is O(n). 3. (T/F) The best case complexity of SELECTION SORT is (n 4. (T/F) The best case complexity of MERGE SORT is O(n log n). 5. (T/F) The best case complexity of QUICKSORT (with fixed pivot) is O(n). 6. (T/F) The worst case complexity of BUBBLE SORT is O(nlogn. 7. (T/F) The worst case complexity of INSERTION SORT is O(n2 8. (T/F) The worst case complexity of SELECTION SORT is O(n2 9. (T/F) The worst case complexity of MERGE SORT is O(n2) 10. (T/F) The worst case complexity of QUICKSORT (with fixed pivot) is 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
