📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    Which of the following sorting technique is an example

    of Divide and Conquer technique?
    A Selection sort Correct Answer Incorrect Answer
    B Quick sort Correct Answer Incorrect Answer
    C Bubble sort Correct Answer Incorrect Answer
    D Insertion sort Correct Answer Incorrect Answer

    Solution

    Why this is correct:
    Quick sort divides the array into subarrays (partitioning around a pivot) and then recursively sorts the subarrays — a classic divide-and-conquer approach. Why the others are wrong:

    • 1 (Selection sort): Comparison-based but not divide-and-conquer; it repeatedly selects min/max.
    • 3 (Bubble sort): Iterative adjacent-swapping method, not divide-and-conquer.
    • 4 (Insertion sort): Builds sorted array one element at a time—again not divide-and-conquer.

    Practice Next
    More IT Operating System Questions

    Relevant for Exams:

    ask-question