1. What is the time complexity of the Bubble Sort algorithm in the worst case?
2. Which of the following is NOT a characteristic of a good algorithm?
3. What is the space complexity of the Merge Sort algorithm?
4. Which of the following is an example of a divide and conquer algorithm?
5. What is the best-case time complexity of the Binary Search algorithm?
6. Which notation represents the upper bound of an algorithm's running time?
7. What does the Big-Ω notation represent?
8. Which of the following is true about the Big-Θ notation?
9. What is the time complexity of the following code snippet? for (int i = 0; i < n; i++) { ... }
for (int i = 0; i < n; i++) { ... }
10. What is the time complexity of the following code snippet? for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ... } }
for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ... } }
11. Which of the following is NOT a divide and conquer algorithm?
12. What is the time complexity of the Merge Sort algorithm?
13. What is the worst-case time complexity of the Quick Sort algorithm?
14. Which of the following is a disadvantage of the Quick Sort algorithm?
15. What is the time complexity of the Binary Search algorithm?
16. What is the time complexity of the Selection Sort algorithm in the worst case?
17. Which of the following is an example of a greedy algorithm?
18. What is the time complexity of the Insertion Sort algorithm in the best case?
19. Which of the following is NOT a sorting algorithm?
20. What is the time complexity of the Heap Sort algorithm?
21. Which of the following is true about the Little-o notation?
22. What is the time complexity of the following code snippet? for (int i = 0; i < n; i *= 2) { ... }
for (int i = 0; i < n; i *= 2) { ... }
23. What is the time complexity of the following code snippet? for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { ... } }
for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { ... } }
24. Which of the following is true about the Big-Θ notation?
25. What is the time complexity of the following code snippet? for (int i = 0; i < n; i++) { for (int j = 0; j < n; j *= 2) { ... } }
for (int i = 0; i < n; i++) { for (int j = 0; j < n; j *= 2) { ... } }
26. Which of the following is a divide and conquer algorithm?
27. What is the time complexity of the Quick Sort algorithm in the average case?
28. Which of the following is a disadvantage of the Merge Sort algorithm?
29. What is the time complexity of the Binary Search algorithm in the worst case?
30. Which of the following is true about the Quick Sort algorithm?