Question: Sorting Algorithms, Review Questions Why does the bubbleSort algorithm take less time on the ascending ordered list than the descending ordered list? Why does the
Sorting Algorithms, Review Questions
- Why does the bubbleSort algorithm take less time on the ascending ordered list than the descending ordered list?
- Why does the bubbleSortB algorithm take A LOT less time on the ascending ordered list than the descending ordered list?
- Why does the insertionSort algorithm take A LOT less time on the ascending ordered list than the descending ordered list?
- Why does the insertionSort algorithm take less time on the descending ordered list than the bubbleSort algorithm on the descending ordered list?
- Why does the selectionSort algorithm take less time on the descending ordered list than the insertionSort algorithm on the descending ordered list?
- Both advanced sorting algorithms are O (n log2 n) on initially random data. Why do you suppose quick sort is the fastest advanced sort on random items?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
