Scribd Logo
Upload

Welcome to Scribd!

  • ES85 W6.Ass1. Alajid K1

    Uploaded by

    Earl Nino Alajid
    5 views5 pages
    Quicksort is a highly efficient sorting technique that recursively divides a large array into smaller subarrays by selecting a pivot element. It partitions the array into two parts, with values smaller than the pivot in the left part and larger values in the right part. This process is then applied recursively to each subarray until the entire array is sorted. While quicksort has an efficient inner loop, it is a recursive algorithm so implementation can be tricky and errors can cause performance issues.

    Original Description:

    Original Title

    ES85-W6.Ass1.-Alajid-K1.pptx

    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
    Quicksort is a highly efficient sorting technique that recursively divides a large array into smaller subarrays by selecting a pivot element. It partitions the array into two parts, with values smaller than the pivot in the left part and larger values in the right part. This process is then applied recursively to each subarray until the entire array is sorted. While quicksort has an efficient inner loop, it is a recursive algorithm so implementation can be tricky and errors can cause performance issues.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views5 pages

    ES85 W6.Ass1. Alajid K1

    Uploaded by

    Earl Nino Alajid
    Quicksort is a highly efficient sorting technique that recursively divides a large array into smaller subarrays by selecting a pivot element. It partitions the array into two parts, with values smaller than the pivot in the left part and larger values in the right part. This process is then applied recursively to each subarray until the entire array is sorted. While quicksort has an efficient inner loop, it is a recursive algorithm so implementation can be tricky and errors can cause performance issues.

    Copyright:

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

    QUICK SORT

    Earl Nino U. Alajid


    ES085- K1
    WHAT IS QUICK SORT
    Quicksort is a highly efficient sorting technique that divides a large data array into
    smaller ones. A vast array is divided into two arrays, one containing values smaller
    than the provided value, say pivot, on which the partition is based. The other contains
    values greater than the pivot value.
    We recursively perform these three steps:
    1. Bring the pivot to its appropriate position such that left of the pivot is smaller and
    right is greater
    2. Quick sort the left part
    3. Quick sort the right part
    QUICK SORT EXAMPLE
    8 2 4 7 1 3 9 6 5

    2 4 1 3 5 7 9 6 8

    2 1 3 4 7 6 8 9

    1 2 4 6 7 9

    1 2 3 4 5 6 7 8 9
    CODE
    ADVANTAGES AND
    DISADVANTAGES OF
    QUICKSORT
    Advantage
    •Its inner loop is relatively short.
    •After a thorough mathematical investigation of this algorithm, you can make a
    reasonably specific statement about performance issues.
    Disadvantage
    •It is a recursive process. The implementation is quite tricky, mainly if recursion is
    not provided.
    • It is fragile in the sense that a slight error in implementation can go unreported and
    cause it to function poorly.

    You might also like