Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
525 views

Data Structure - Bubble Sort Algorithm

Bubble sort is a simple sorting algorithm that compares adjacent elements and swaps them if out of order. It repeats this process until the list is fully sorted, but is not efficient for large data sets due to its quadratic time complexity. The algorithm can be improved by adding a flag to stop iterating once no swaps occur, and restricting comparisons to unsorted portions of the list after each pass.

Uploaded by

Lea Lovato
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
525 views

Data Structure - Bubble Sort Algorithm

Bubble sort is a simple sorting algorithm that compares adjacent elements and swaps them if out of order. It repeats this process until the list is fully sorted, but is not efficient for large data sets due to its quadratic time complexity. The algorithm can be improved by adding a flag to stop iterating once no swaps occur, and restricting comparisons to unsorted portions of the list after each pass.

Uploaded by

Lea Lovato
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Data Structure - Bubble Sort Algorithm

 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?
Algorithm
Pseudocode
 We observe in algorithm that Bubble Sort compares
each pair of array element unless the whole array
is completely sorted in an ascending order.
 This may cause a few complexity issues like what if
the array needs no more swapping as all the
elements are already ascending.
 To ease-out the issue, we use one flag
variable swapped which will help us see if any
swap has happened or not.
 If no swap has occurred, i.e. the array requires no
more processing to be sorted, it will come out of the
loop.
Implementation
 One more issue we did not address in our original
algorithm and its improvised pseudocode, is that,
after every iteration the highest values settles down
at the end of the array.
 Hence, the next iteration need not include already
sorted elements.
 For this purpose, in our implementation, we restrict
the inner loop to avoid already sorted values.

You might also like