Scribd Logo
Upload

Welcome to Scribd!

  • 72 views

    Solution:: Assignment 2 CS502

    Uploaded by

    Mahmmood Alam
    The document describes an algorithm to sort an array using quicksort. It involves partitioning the array around a pivot element, and recursively sorting the subarrays on each side of the pivot. The partition process swaps elements in the array so that all elements smaller than the pivot are to the left, and all larger elements are to the right, with the pivot between them. This partitions the array around the pivot element. The quicksort algorithm then recursively calls this partition-and-sort process on the subarrays until the entire array is sorted.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Solution:: Assignment 2 CS502

    Uploaded by

    Mahmmood Alam
    72 views2 pages
    The document describes an algorithm to sort an array using quicksort. It involves partitioning the array around a pivot element, and recursively sorting the subarrays on each side of the pivot. The partition process swaps elements in the array so that all elements smaller than the pivot are to the left, and all larger elements are to the right, with the pivot between them. This partitions the array around the pivot element. The quicksort algorithm then recursively calls this partition-and-sort process on the subarrays until the entire array is sorted.

    Original Description:

    CS502 Assignment 2 Solution Spring 2019

    Original Title

    Cs502 Assignment 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes an algorithm to sort an array using quicksort. It involves partitioning the array around a pivot element, and recursively sorting the subarrays on each side of the pivot. The partition process swaps elements in the array so that all elements smaller than the pivot are to the left, and all larger elements are to the right, with the pivot between them. This partitions the array around the pivot element. The quicksort algorithm then recursively calls this partition-and-sort process on the subarrays until the entire array is sorted.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    72 views2 pages

    Solution:: Assignment 2 CS502

    Uploaded by

    Mahmmood Alam
    The document describes an algorithm to sort an array using quicksort. It involves partitioning the array around a pivot element, and recursively sorting the subarrays on each side of the pivot. The partition process swaps elements in the array so that all elements smaller than the pivot are to the left, and all larger elements are to the right, with the pivot between them. This partitions the array around the pivot element. The quicksort algorithm then recursively calls this partition-and-sort process on the subarrays until the entire array is sorted.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 2

    ASSIGNMENT 2

    CS502

    Solution:

    5 7

    25 13 19 12

    30 27 26

    (b)

    30

    27 19

    25 26 5 12

    1 13 7
    Question No. 02 (Marks 10)

    PART( array B, int p, int r)


    1. x ← B[p]
    2. q ← p
    3. for s ← p + 1 to r
    4. do if (B[s] < x)
    5. then q ← q + 1
    6. swap B[q] with B[s]
    7. swap B[p] with B[q]
    8. return q

    9 1 7 20 12 18 2 15 4 17

    9 1 7 20 12 18 2 15 4 17

    9 1 7 20 12 18 2 15 4 17

    9 1 7 20 12 18 2 15 4 17

    9 1 7 20 12 18 2 15 4 17

    9 1 7 20 12 18 2 15 4 17

    9 1 7 2 12 18 20 15 4 17

    9 1 7 2 12 18 20 15 4 17

    9 1 7 2 4 18 20 15 12 17

    4 1 7 2 9 18 20 15 12 17

    QUICKSORT( array B, int p, int r)


    1. if (r>p)
    2. then
    3. i ← a random index from [p….r]
    4. swap B[i] with B[p]
    5. q ← PARTITION(B,p,r)
    6. QUICKSORT(B,p,q-1)
    7. QUICKSORT(B,q+1,r)

    You might also like