Fill Big-O notations in the following table for the comparison Queue implementat

Question

Fill Big-O notations in the following table for the comparison Queue implementations. Select your answer from A. B. C. D. E. F. and G for each blank in the following statements. A. selectionSorf B. bubbleSort C. shortBubble D. insertionSort E. mergeSort F. quicksort G. heapSort (1) B/D's Big-O complexity is O(N) for Best case. (2) D/C recognize(s) if the values are already sorted, (3) F/G/A is (are) inherently unstable. A/C Big-O complexity is always O(N^2) for Best case. Average case, and Worst Case G/F, s Big-O complexity is always 0(log_2 N) for Best case. Average case, and W or case.

Explanation / Answer

1) Bubble Sort is O(N) , Short Bubble Sort is also O(N) in best case and Insertion Sort is also O(N) So
B, C, D

2) When the list is Sorted that results in best case for (1) , So all ther three B, C, D recognises

3) A, G, F are unstable

4) A selection is O(N^2) in all the cases

5) G and E has nlog n irrespective of input

Thanks, let mw know if there is any concern and yeah learn more about shortBubble, Its Worst case is N^2 and best case is N

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.