Scribd Logo
Upload

Welcome to Scribd!

  • 918 views

    1.2 Bubble Sort Student

    Uploaded by

    nik_dmaths
    Bubble sort is an algorithm that sorts numbers in ascending order by repeatedly swapping adjacent elements that are in the wrong order until no swaps are needed. It works by comparing neighboring elements and swapping them if they are in the wrong order, with the largest elements gradually "bubbling" to the top of the list. The algorithm makes multiple passes through the list until it is fully sorted, even if earlier passes have fully sorted it.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    1.2 Bubble Sort Student

    Uploaded by

    nik_dmaths
    918 views2 pages
    Bubble sort is an algorithm that sorts numbers in ascending order by repeatedly swapping adjacent elements that are in the wrong order until no swaps are needed. It works by comparing neighboring elements and swapping them if they are in the wrong order, with the largest elements gradually "bubbling" to the top of the list. The algorithm makes multiple passes through the list until it is fully sorted, even if earlier passes have fully sorted it.

    Original Description:

    Bubble Sort handout student edition

    Original Title

    1.2 Bubble Sort student.docx

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Bubble sort is an algorithm that sorts numbers in ascending order by repeatedly swapping adjacent elements that are in the wrong order until no swaps are needed. It works by comparing neighboring elements and swapping them if they are in the wrong order, with the largest elements gradually "bubbling" to the top of the list. The algorithm makes multiple passes through the list until it is fully sorted, even if earlier passes have fully sorted it.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    918 views2 pages

    1.2 Bubble Sort Student

    Uploaded by

    nik_dmaths
    Bubble sort is an algorithm that sorts numbers in ascending order by repeatedly swapping adjacent elements that are in the wrong order until no swaps are needed. It works by comparing neighboring elements and swapping them if they are in the wrong order, with the largest elements gradually "bubbling" to the top of the list. The algorithm makes multiple passes through the list until it is fully sorted, even if earlier passes have fully sorted it.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    Bubble Sort

    What is bubble sort?


    Bubble sort is an algorithm for sorting numbers into ascending order. You could be asked to trace the algorithm and/or compare how efficient it is.

    Bubble Sort
    What is bubble sort?
    Bubble sort is an algorithm for sorting numbers into ascending order. You could be asked to trace the algorithm and/or compare how efficient it is.

    Bubble Sort Algorithm


    Line 10: If there is only one item in the list, stop Line 20: Make one pass down the list, swapping items as necessary Line 30: If no swaps occurred then stop, otherwise ignore the last item and return to step one In the bubble sort algorithm, the largest number in each pass bubbles to the top, and then is ignored for each successive pass. Even if all the numbers are ordered after a pass, the algorithm does not stop until another pass has been made to ensure there are no swaps to be made. Example Use bubble sort to sort the numbers 6, 4, 8, 3, 7, 4 into ascending order Pass Start Pass 1 List 6 4 4 4 4 4 After Pass 1 Pass 2 4 4 4 4 4 After Pass 2 Pass 3 4 3 3 3 After Pass 3 Pass 4 After Pass 4 3 3 3 3 4 6 6 6 6 6 6 6 3 3 3 3 4 4 4 4 4 4 4 8 8 8 3 3 3 3 3 6 6 6 6 6 6 4 4 4 4 4 3 3 3 8 7 7 7 7 7 7 4 4 4 4 6 6 6 6 6 7 7 7 7 8 4 4 4 4 4 7 7 7 7 7 7 7 7 7 4 4 4 4 4 8 8 8 8 8 8 8 8 8 8 8 8 8 8 Swap 6 and 4 Dont swap 6 and 8 Swap 8 and 3 Swap 8 and 7 Swap 8 and 4 8 is fixed Dont swap 4 and 6 Swap 3 and 6 Dont swap 6 and 7 Swap 7 and 4 7 and 8 are fixed Swap 4 and 3 Dont swap 4 and 6 Swap 6 and 4 6, 7 and 8 are fixed Dont swap 3 and 4 Dont swap 4 and 4 All are fixed Notes

    Bubble Sort Algorithm


    Line 10: If there is only one item in the list, stop Line 20: Make one pass down the list, swapping items as necessary Line 30: If no swaps occurred then stop, otherwise ignore the last item and return to step one In the bubble sort algorithm, the largest number in each pass bubbles to the top, and then is ignored for each successive pass. Even if all the numbers are ordered after a pass, the algorithm does not stop until another pass has been made to ensure there are no swaps to be made. Example Use bubble sort to sort the numbers 6, 4, 8, 3, 7, 4 into ascending order Pass Start Pass 1 List 6 4 4 4 4 4 After Pass 1 Pass 2 4 4 4 4 4 After Pass 2 Pass 3 4 3 3 3 After Pass 3 Pass 4 After Pass 4 3 3 3 3 4 6 6 6 6 6 6 6 3 3 3 3 4 4 4 4 4 4 4 8 8 8 3 3 3 3 3 6 6 6 6 6 6 4 4 4 4 4 3 3 3 8 7 7 7 7 7 7 4 4 4 4 6 6 6 6 6 7 7 7 7 8 4 4 4 4 4 7 7 7 7 7 7 7 7 7 4 4 4 4 4 8 8 8 8 8 8 8 8 8 8 8 8 8 8 Swap 6 and 4 Dont swap 6 and 8 Swap 8 and 3 Swap 8 and 7 Swap 8 and 4 8 is fixed Dont swap 4 and 6 Swap 3 and 6 Dont swap 6 and 7 Swap 7 and 4 7 and 8 are fixed Swap 4 and 3 Dont swap 4 and 6 Swap 6 and 4 6, 7 and 8 are fixed Dont swap 3 and 4 Dont swap 4 and 4 All are fixed Notes

    You might also like