Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Bubble Sort & Quick Sort

    Uploaded by

    Dian Santi
    Bubble sort and quick sort are two common algorithms used to sort data. Bubble sort compares adjacent elements and swaps them if they are in the wrong order, repeating this process until the list is fully sorted. Quick sort chooses a "pivot" element and partitions the list into sublists based on whether elements are less than or greater than the pivot, and then recursively sorts the sublists.

    Copyright:

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

    You might also like

    Bubble Sort & Quick Sort

    Uploaded by

    Dian Santi
    2 views1 page
    Bubble sort and quick sort are two common algorithms used to sort data. Bubble sort compares adjacent elements and swaps them if they are in the wrong order, repeating this process until the list is fully sorted. Quick sort chooses a "pivot" element and partitions the list into sublists based on whether elements are less than or greater than the pivot, and then recursively sorts the sublists.

    Original Description:

    hjhjh

    Original Title

    Presentation

    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
    Bubble sort and quick sort are two common algorithms used to sort data. Bubble sort compares adjacent elements and swaps them if they are in the wrong order, repeating this process until the list is fully sorted. Quick sort chooses a "pivot" element and partitions the list into sublists based on whether elements are less than or greater than the pivot, and then recursively sorts the sublists.

    Copyright:

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

    Bubble Sort & Quick Sort

    Uploaded by

    Dian Santi
    Bubble sort and quick sort are two common algorithms used to sort data. Bubble sort compares adjacent elements and swaps them if they are in the wrong order, repeating this process until the list is fully sorted. Quick sort chooses a "pivot" element and partitions the list into sublists based on whether elements are less than or greater than the pivot, and then recursively sorts the sublists.

    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 1

    BUBBLE SORT & QUICK

    SORT

    You might also like