Scribd Logo
Upload

Welcome to Scribd!

  • Bubble Sort

    Uploaded by

    HeadofDepartmentCS SSCP
    11 views8 pages
    The document shows the steps of bubble sort algorithm sorting an array of numbers. It performs 7 passes over the array, swapping adjacent elements out of order from left to right until the array is fully sorted. Each pass reduces the subarray length by 1 until sorted from lowest to highest as [2, 4, 5, 7, 8, 13, 16, 19].

    Original Description:

    Original Title

    bubble sort

    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
    The document shows the steps of bubble sort algorithm sorting an array of numbers. It performs 7 passes over the array, swapping adjacent elements out of order from left to right until the array is fully sorted. Each pass reduces the subarray length by 1 until sorted from lowest to highest as [2, 4, 5, 7, 8, 13, 16, 19].

    Copyright:

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

    Bubble Sort

    Uploaded by

    HeadofDepartmentCS SSCP
    The document shows the steps of bubble sort algorithm sorting an array of numbers. It performs 7 passes over the array, swapping adjacent elements out of order from left to right until the array is fully sorted. Each pass reduces the subarray length by 1 until sorted from lowest to highest as [2, 4, 5, 7, 8, 13, 16, 19].

    Copyright:

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

    8 4 19 2 7 13 5 16

    Pass 1 k=0 A[k]>A[k+1] , n

    4 8 19 2 7 13 5 16

    4 8 2 19 7 13 5 16

    4 8 2 7 19 13 5 16

    4 8 2 7 13 19 5 16

    4 8 2 7 13 5 19 16

    4 8 2 7 13 5 16 19
    4 8 2 7 13 5 16 19

    Pass 2 k=0 A[k]>A[k+1] , n=n-1

    4 8 2 7 13 5 16 19

    4 2 8 7 13 5 16 19

    4 2 7 8 13 5 16 19

    4 2 7 8 5 13 16 19

    4 2 7 8 5 13 16 19
    4 2 7 8 5 13 16 19

    Pass 3 k=0 A[k]>A[k+1] , n=n-1

    2 4 7 8 5 13 16 19

    2 4 7 8 5 13 16 19

    2 4 7 8 5 13 16 19

    2 4 7 5 8 13 16 19

    2 4 7 5 8 13 16 19
    2 4 7 5 8 13 16 19

    Pass 4 k=0 A[k]>A[k+1] , n=n-1

    2 4 7 5 8 13 16 19

    2 4 7 5 8 13 16 19

    2 4 5 7 8 13 16 19

    2 4 5 7 8 13 16 19
    2 4 5 7 8 13 16 19

    Pass 5 k=0 A[k]>A[k+1] , n=n-1

    2 4 5 7 8 13 16 19

    2 4 5 7 8 13 16 19

    2 4 5 7 8 13 16 19
    2 4 5 7 8 13 16 19

    Pass 6 k=0 A[k]>A[k+1] , n=n-1

    2 4 5 7 8 13 16 19

    2 4 5 7 8 13 16 19
    2 4 5 7 8 13 16 19

    Pass 7 k=0 A[k]>A[k+1] , n=n-1

    2 4 5 7 8 13 16 19
    Algorithm – Bubble Sort
    • Step1: Repeat step 2 and 3 for k=1 to N-1
    • Step2: set PTR=1
    • Step3: Repeat while PTR <= N – K :
    • A) if DATA[PTR]>DATA[PTR+1] then:
    • Interchange DATA[PTR] and DATA[PTR+1]
    • [End of IF structure]
    • Set PTR = PTR+1
    • [End of inner loop]
    • [End of step 1 outer loop]
    • Step4:EXIT.

    You might also like