Scribd
Upload
212 views3 pages

Bubble Sort

Bubble sort is a simple sorting algorithm that compares adjacent elements and swaps them if they are out of order. It works by repeatedly swapping adjacent elements that are in the wrong order until the list is fully sorted. However, bubble sort has a poor average time complexity of Ο(n2) where n is the number of items, making it inefficient for large data sets. It works by making multiple passes through the list, swapping adjacent elements on each pass until no swaps are needed, indicating the list is fully sorted.

Uploaded by

Muzamil Yousaf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
212 views3 pages

Bubble Sort

Bubble sort is a simple sorting algorithm that compares adjacent elements and swaps them if they are out of order. It works by repeatedly swapping adjacent elements that are in the wrong order until the list is fully sorted. However, bubble sort has a poor average time complexity of Ο(n2) where n is the number of items, making it inefficient for large data sets. It works by making multiple passes through the list, swapping adjacent elements on each pass until no swaps are needed, indicating the list is fully sorted.

Uploaded by

Muzamil Yousaf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Bubble Sort

Bubble sort is a simple sorting algorithm. This sorting algorithm is comparison-based


algorithm in which each pair of adjacent elements is compared and the elements are
swapped if they are not in order. This algorithm is not suitable for large data sets as its
average and worst case complexity are of Ο(n2) where n is the number of items.

How Bubble Sort Works?


We take an unsorted array for our example. Bubble sort takes Ο(n 2) time so we're
keeping it short and precise.

Bubble sort starts with very first two elements, comparing them to check which one is
greater.

In this case, value 33 is greater than 14, so it is already in sorted locations. Next, we
compare 33 with 27.

We find that 27 is smaller than 33 and these two values must be swapped.

The new array should look like this −

Next we compare 33 and 35. We find that both are in already sorted positions.

Then we move to the next two values, 35 and 10.


We know then that 10 is smaller 35. Hence they are not sorted.

We swap these values. We find that we have reached the end of the array. After one
iteration, the array should look like this −

To be precise, we are now showing how an array should look like after each iteration.
After the second iteration, it should look like this −

Notice that after each iteration, at least one value moves at the end.

And when there's no swap required, bubble sorts learns that an array is completely
sorted.

Now we should look into some practical aspects of bubble sort.

Algorithm
We assume list is an array of n elements. We further assume that swap function
swaps the values of the given array elements.
begin BubbleSort(list)

for all elements of list


if list[i] > list[i+1]
swap(list[i], list[i+1])
end if
end for
return list

end BubbleSort

You might also like