1. : What is the time complexity of bubble sort in the worst case?
(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(log n)
2. : Which of the following sorting algorithms is based on the divide and conquer strategy?
(A) Bubble Sort
(B) Selection Sort
(C) Quick Sort
(D) Insertion Sort
3. : What is the main advantage of the merge sort algorithm?
(A) It is in-place
(B) It is stable
(C) It is faster than quick sort
(D) None of the above
4. : Which searching algorithm is optimal for a sorted array?
(A) Linear Search
(B) Binary Search
(C) Jump Search
(D) Interpolation Search
5. : What is the time complexity of insertion sort in the best case?
(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(log n)
6. : Which of the following is a characteristic of selection sort?
(A) It is stable
(B) It requires additional memory
(C) It has a fixed number of comparisons
(D) It works well on large datasets
7. : What is the average-case time complexity of quick sort?
(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(log n)
8. : Which of the following algorithms is the most efficient for large datasets?
(A) Bubble Sort
(B) Selection Sort
(C) Merge Sort
(D) Insertion Sort
9. : What is the main disadvantage of quick sort?
(A) It is slow
(B) It is not stable
(C) It uses extra memory
(D) None of the above
10. : Which searching technique can be applied to both sorted and unsorted arrays?
(A) Linear Search
(B) Binary Search
(C) Exponential Search
(D) Interpolation Search
11. : What is the time complexity of linear search?
(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) O(1)
12. : Which of the following algorithms uses a pivot element for sorting?
(A) Bubble Sort
(B) Merge Sort
(C) Quick Sort
(D) Heap Sort
13. : What is the worst-case time complexity of merge sort?
(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(log n)
14. : In which sorting algorithm does each element get compared to every other element?
(A) Quick Sort
(B) Bubble Sort
(C) Selection Sort
(D) All of the above
15. : What is a key property of a stable sorting algorithm?
(A) It uses less memory
(B) It preserves the relative order of equal elements
(C) It runs in linear time
(D) None of the above
16. : What is the primary use of interpolation search?
(A) Searching in a sorted array
(B) Searching in an unsorted array
(C) Sorting elements
(D) None of the above
17. : Which algorithm is not a comparison-based sorting algorithm?
(A) Bubble Sort
(B) Heap Sort
(C) Counting Sort
(D) Merge Sort
18. : What is the space complexity of merge sort?
(A) O(1)
(B) O(n)
(C) O(n log n)
(D) O(log n)
19. : What is the best-case scenario for quick sort?
(A) When the array is already sorted
(B) When the pivot divides the array into two equal halves
(C) When all elements are unique
(D) None of the above
20. : Which of the following algorithms sorts in place?
(A) Merge Sort
(B) Quick Sort
(C) Heap Sort
(D) Both B and C
21. : What is the average-case time complexity of selection sort?
(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(log n)
22. : Which of the following is true about binary search?
(A) It can be used on unsorted arrays
(B) It requires the array to be sorted
(C) It is always faster than linear search
(D) None of the above
23. : What is the time complexity of heap sort?
(A) O(n)
(B) O(n log n)
(C) O(n²)
(D) O(log n)
24. : In which algorithm do elements “bubble” to their correct position?
(A) Quick Sort
(B) Bubble Sort
(C) Insertion Sort
(D) Selection Sort
25. : Which algorithm is typically faster for small datasets?
(A) Merge Sort
(B) Quick Sort
(C) Insertion Sort
(D) Selection Sort
26. : What is the primary characteristic of the counting sort algorithm?
(A) It is a comparison-based sort
(B) It sorts integers within a fixed range
(C) It works on linked lists
(D) None of the above
27. : Which of the following is a divide and conquer algorithm?
(A) Insertion Sort
(B) Merge Sort
(C) Bubble Sort
(D) Selection Sort
28. : Which sorting algorithm has the lowest worst-case time complexity?
(A) Quick Sort
(B) Merge Sort
(C) Heap Sort
(D) All have the same complexity
29. : What is the main advantage of the binary search algorithm?
(A) It works with unsorted data
(B) It is always the fastest
(C) It reduces the search space by half each iteration
(D) None of the above
30. : Which of the following sorting algorithms is not stable?
(A) Bubble Sort
(B) Merge Sort
(C) Quick Sort
(D) Insertion Sort
31. : What is the primary disadvantage of selection sort?
(A) It is not stable
(B) It is inefficient for large datasets
(C) It uses extra memory
(D) None of the above
32. : Which of the following algorithms is considered the fastest for large datasets in practice?
(A) Merge Sort
(B) Quick Sort
(C) Heap Sort
(D) Insertion Sort
33. : Which sorting algorithm has the best average-case time complexity?
(A) Bubble Sort
(B) Quick Sort
(C) Merge Sort
(D) Selection Sort
34. : What is the worst-case time complexity of binary search?
(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) O(1)
35. : Which of the following is a characteristic of the heap sort algorithm?
(A) It is a stable sort
(B) It uses a binary heap
(C) It is recursive
(D) None of the above
36. : What is the primary purpose of sorting algorithms?
(A) To arrange data in a specific order
(B) To search for an element
(C) To compress data
(D) None of the above
37. : Which sorting algorithm divides the array into subarrays to sort?
(A) Merge Sort
(B) Quick Sort
(C) Both A and B
(D) None of the above
38. : What is the expected time complexity of searching for an element in a sorted array using binary search?
(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) O(1)
39. : In the context of searching algorithms, what does “divide and conquer” mean?
(A) Splitting the problem into smaller subproblems
(B) Combining results from subproblems
(C) Both A and B
(D) None of the above