Answers
Heap Sort - Worst Time Complexity CORRECT ANS-O(n log(n))
Merge Sort - Average Time Complexity CORRECT ANS-O(n log(n))
Merge Sort - Worst Time Complexity CORRECT ANS-O(n log(n))
Radix Sort - Average Time Complexity CORRECT ANS-O(n)
Radix Sort - Worst Time Complexity CORRECT ANS-O(n)
Bubble Sort - Average Time Complexity CORRECT ANS-O(n^2)
Bubble Sort - Worst Time Complexity CORRECT ANS-O(n^2)
Selection Sort - Average Time Complexity CORRECT ANS-O(n^2)
Selection Sort - Worst Time Complexity CORRECT ANS-O(n^2)
Insertion Sort - Average Time Complexity CORRECT ANS-O(n^2)
Insertion Sort - Worst Time Complexity CORRECT ANS-O(n^2)
Quick Sort - Average Time Complexity CORRECT ANS-O(n log(n))
Quick Sort - Worst Time Complexity CORRECT ANS-O(n^2)