WGU C949 SORTING ALGORITHM BIG
O EXAMS WITH CORRECT SOLUTIONS
1. Bubble Sort - Average Time Complexity - ANSWER-O(n^2)
2. Bubble Sort - Worst Time Complexity - ANSWER-O(n^2)
3. Selection Sort - Average Time Complexity - ANSWER-O(n^2)
4. Selection Sort - Worst Time Complexity - ANSWER-O(n^2)
5. Insertion Sort - Average Time Complexity - ANSWER-O(n^2)
6. Insertion Sort - Worst Time Complexity - ANSWER-O(n^2)
7. Quick Sort - Average Time Complexity - ANSWER-O(n log(n))
8. Quick Sort - Worst Time Complexity - ANSWER-O(n^2)
9. Bucket Sort - Average Time Complexity - ANSWER-O(n)
10. Bucket Sort - Worst Time Complexity - ANSWER-O(n^2)
11. Heap Sort - Average Time Complexity - ANSWER-O(n log(n))
12. Heap Sort - Worst Time Complexity - ANSWER-O(n log(n))
O EXAMS WITH CORRECT SOLUTIONS
1. Bubble Sort - Average Time Complexity - ANSWER-O(n^2)
2. Bubble Sort - Worst Time Complexity - ANSWER-O(n^2)
3. Selection Sort - Average Time Complexity - ANSWER-O(n^2)
4. Selection Sort - Worst Time Complexity - ANSWER-O(n^2)
5. Insertion Sort - Average Time Complexity - ANSWER-O(n^2)
6. Insertion Sort - Worst Time Complexity - ANSWER-O(n^2)
7. Quick Sort - Average Time Complexity - ANSWER-O(n log(n))
8. Quick Sort - Worst Time Complexity - ANSWER-O(n^2)
9. Bucket Sort - Average Time Complexity - ANSWER-O(n)
10. Bucket Sort - Worst Time Complexity - ANSWER-O(n^2)
11. Heap Sort - Average Time Complexity - ANSWER-O(n log(n))
12. Heap Sort - Worst Time Complexity - ANSWER-O(n log(n))