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

    Question

    Which of the following algorithms is a classic example

    of the Divide and Conquer paradigm?
    A Linear Search Correct Answer Incorrect Answer
    B Bubble Sort Correct Answer Incorrect Answer
    C Merge Sort Correct Answer Incorrect Answer
    D Dijkstra's Algorithm Correct Answer Incorrect Answer
    E Prim's Algorithm Correct Answer Incorrect Answer

    Solution

    Merge Sort exemplifies Divide and Conquer:        Divide: It divides the unsorted list into 'N' sublists, each containing one element (a list of one element is considered sorted).        Conquer: It repeatedly merges sublists to produce new sorted sublists until there is only one sorted list remaining.        Combine: The merging process combines the sorted sublists.

    Practice Next
    More IT Operating System Questions
    ask-question