Scribd
Upload
144 views1 page

Bubble Sort Simplified Flowchart

This document outlines the simplified flowchart for bubble sort, an algorithm that iterates through an array and swaps adjacent elements that are out of order until the entire array is sorted. It starts two indexes at the ends of the array and compares the items, swapping them if out of order, then decrementing the second index and incrementing the first index until the entire array has been sorted.

Uploaded by

kocayusuf13
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
144 views1 page

Bubble Sort Simplified Flowchart

This document outlines the simplified flowchart for bubble sort, an algorithm that iterates through an array and swaps adjacent elements that are out of order until the entire array is sorted. It starts two indexes at the ends of the array and compares the items, swapping them if out of order, then decrementing the second index and incrementing the first index until the entire array has been sorted.

Uploaded by

kocayusuf13
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

START

Get array item[1..n]

Bubble Sort Simplified Flowchart

i=1

j=n

item[j] less than item[j-1] ?

yes

Swap item[j] and item[j-1]

no

j = i+1?

j = j-1

i = n-1 ?

i = i+1

END

You might also like