Scribd Logo
Upload

Welcome to Scribd!

  • Merge Sort and Quick Sort Schema Aryo Prasetyo 2602062601

    Uploaded by

    tonis yersup
    9 views2 pages
    Merge sort splits an array in half, recursively sorts each half, and then merges the sorted halves back together. Quick sort chooses a pivot element and partitions the array into two halves based on element values relative to the pivot, and then recursively applies quick sort to each half. The document provides pseudocode for merge sort and illustrates quick sort partitioning on an example array from indices 0 to 9.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Merge sort splits an array in half, recursively sorts each half, and then merges the sorted halves back together. Quick sort chooses a pivot element and partitions the array into two halves based on element values relative to the pivot, and then recursively applies quick sort to each half. The document provides pseudocode for merge sort and illustrates quick sort partitioning on an example array from indices 0 to 9.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views2 pages

    Merge Sort and Quick Sort Schema Aryo Prasetyo 2602062601

    Uploaded by

    tonis yersup
    Merge sort splits an array in half, recursively sorts each half, and then merges the sorted halves back together. Quick sort chooses a pivot element and partitions the array into two halves based on element values relative to the pivot, and then recursively applies quick sort to each half. The document provides pseudocode for merge sort and illustrates quick sort partitioning on an example array from indices 0 to 9.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Merge Sort and Quick Sort Schema

    Name: Aryo Prasetyo


    NIM : 2602062601
    Merge Sort
    MS() = split array
    M() = merge array
    Quick Sort

    QS (0,9)
    1
    43 32 19 27 4 20 11 48 51
    6

    QS (0,8) QS (9,9)
    3 1 2
    11 19 27 4 43
    2 6 0

    QS (0,7) QS (9,8)
    2 3
    4 11 19 16 20
    7 2

    QS (0,0) QS (2,7)

    16 19 27 32 20

    QS (2,2) QS (4,7)

    20 27 32

    QS (4,4) QS (7,7)

    4 11 16 19 20 27 32 43 48 51

    You might also like