Scribd Logo
Upload

Welcome to Scribd!

  • QS - PG 1 PDF

    Uploaded by

    rahul
    8 views1 page
    The document describes the Quick Sort algorithm for sorting an array A from index p to r. It works by first partitioning the array around a pivot value, and then recursively sorting the subarrays to the left and right of the pivot. The Partition function moves all elements less than the pivot value to the left of it and all greater elements to the right, returning the final index of the pivot.

    Original Description:

    Original Title

    QS_pg 1.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the Quick Sort algorithm for sorting an array A from index p to r. It works by first partitioning the array around a pivot value, and then recursively sorting the subarrays to the left and right of the pivot. The Partition function moves all elements less than the pivot value to the left of it and all greater elements to the right, returning the final index of the pivot.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    QS - PG 1 PDF

    Uploaded by

    rahul
    The document describes the Quick Sort algorithm for sorting an array A from index p to r. It works by first partitioning the array around a pivot value, and then recursively sorting the subarrays to the left and right of the pivot. The Partition function moves all elements less than the pivot value to the left of it and all greater elements to the right, returning the final index of the pivot.

    Copyright:

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

    Quick Sort 1

    28 September 2020 09:54

    Quick Sort (A, p, r)

    if (p < r) then
    q ← Partition (A, p, r)

    Quick Sort (A, p, q-1)

    Quick Sort (A, q+1, r)

    Partition (A, p, r)
    x = A[r]
    i=p-1
    for j = p to r-1 do
    if A[j] < x then
    i = i +1
    exchange A[i] and A[j]
    exchange A[i+1] and A[r]
    return (i+1)

    FOCA M3 Page 1

    You might also like