Crack the Code: Sorting Algorithms Interview Quiz Quiz

1. Q1

   Which sorting algorithm has a time complexity of O(n log n) in the average and worst-case scenarios?

   1. Bubble Sort
   2. Insertion Sort
   3. Merge Sort
   4. Selection Sort

2. Q2

   What is the space complexity of the recursive implementation of Merge Sort?

   1. O(1)
   2. O(log n)
   3. O(n)
   4. O(n log n)

3. Q3

   Which sorting algorithm is considered an in-place algorithm?

   1. Merge Sort
   2. Quick Sort
   3. Counting Sort
   4. Radix Sort

4. Q4

   In the context of sorting algorithms, what does 'stability' refer to?

   1. The algorithm's resistance to crashes
   2. The amount of memory the algorithm requires
   3. The algorithm's ability to maintain the relative order of equal elements
   4. How quickly the algorithm runs on a cold machine

5. Q5

   Which sorting algorithm performs best when the input array is nearly sorted?

   1. Bubble Sort
   2. Quick Sort
   3. Merge Sort
   4. Selection Sort

6. Q6

   What is the worst-case time complexity of Quick Sort?

   1. O(n)
   2. O(n log n)
   3. O(n^2)
   4. O(log n)

7. Q7

   Which data structure is typically used to implement Heap Sort?

   1. Queue
   2. Stack
   3. Binary Search Tree
   4. Heap

8. Q8

   Which sorting algorithm has the best time complexity in the best-case scenario?

   1. Quick Sort
   2. Merge Sort
   3. Insertion Sort
   4. Selection Sort

9. Q9

   Which sorting algorithm is not a comparison-based algorithm?

   1. Bubble Sort
   2. Merge Sort
   3. Quick Sort
   4. Counting Sort

10. Q10

    Which of the following sorting algorithms has a time complexity that is NOT affected by the initial order of elements in the input array?

    1. Insertion Sort
    2. Quick Sort
    3. Selection Sort
    4. Bubble Sort

11. Q11

    Which of the following sorting algorithms requires additional space proportional to the range of input elements?

    1. Bubble Sort
    2. Heap Sort
    3. Merge Sort
    4. Counting Sort

12. Q12

    Which sorting algorithm is most efficient for sorting linked lists?

    1. Quick Sort
    2. Insertion Sort
    3. Merge Sort
    4. Bubble Sort

13. Q13

    What is the typical space complexity of Insertion Sort?

    1. O(n)
    2. O(log n)
    3. O(n log n)
    4. O(1)

14. Q14

    Which of the following sorting algorithms is generally preferred when memory is extremely limited?

    1. Merge Sort
    2. Quick Sort
    3. Heap Sort
    4. Radix Sort

15. Q15

    In which scenario is Bucket Sort most effective?

    1. When the input is nearly sorted.
    2. When the input contains only a few distinct elements
    3. When the input is uniformly distributed over a range
    4. Wen the input is inversely sorted.