Scribd Logo
Upload

Welcome to Scribd!

  • Divide and Conquer

    Uploaded by

    Muhammad hanzla
    17 views7 pages
    Merge Sort is a sorting algorithm that divides an array into halves, recursively sorts each half, and then merges the sorted halves into one sorted array. It uses a divide and conquer approach by breaking down a problem into sub-problems, solving those sub-problems, and then combining the solutions into the final solution. The recurrence equation for Merge Sort is O(n log n) as each level of recursion halves the problem size, resulting in log n levels of recursion needed to sort n elements.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Merge Sort is a sorting algorithm that divides an array into halves, recursively sorts each half, and then merges the sorted halves into one sorted array. It uses a divide and conquer approach by breaking down a problem into sub-problems, solving those sub-problems, and then combining the solutions into the final solution. The recurrence equation for Merge Sort is O(n log n) as each level of recursion halves the problem size, resulting in log n levels of recursion needed to sort n elements.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    17 views7 pages

    Divide and Conquer

    Uploaded by

    Muhammad hanzla
    Merge Sort is a sorting algorithm that divides an array into halves, recursively sorts each half, and then merges the sorted halves into one sorted array. It uses a divide and conquer approach by breaking down a problem into sub-problems, solving those sub-problems, and then combining the solutions into the final solution. The recurrence equation for Merge Sort is O(n log n) as each level of recursion halves the problem size, resulting in log n levels of recursion needed to sort n elements.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 7

    Divide and Conquer

    Merge Sort
    Recurrence equation
    -General Recurrence equation

    -Merge Sort Recurrence equation

    You might also like