Bubble sort c program logic

However, 4, 2 is an incorrect order. Therefore, we swap 4 and 2 to get [1, 2, 4, 3, 5]. Now again, 4, 3 is incorrect so we do another swap and get [1, 2, 3, 4, 5]. As an example, check this graphic that pictorially depicts how bubble sort works.

This is because this largest element will always break the desired order. So, at the end of the first pass, the largest element will always reach its correct position.

Now that the largest element has reached its correct position for instance, 5 reached the last position , we can simply ignore it and concentrate on the rest of the array [1, 4, 2, 3] in the above case. Here, the largest element in the rest of the array which is 4 will be nothing but the second largest element in the array. By the above recursive argument, this second largest array will then reach the last position in the remaining array [1, 2, 3, 4].

This is nothing but a recursive argument on the remaining array. Finally, the array gets sorted. We loop n times - once for each element of the array.

So on and so forth. Bubble sort is a fairly simple algorithm. It forms an interesting example of how simple computations can be used to perform more complex tasks.

However, there is one issue with the algorithm - it is relatively slower compared to other sorting algorithms. To understand that, let us take a look at the loops involved - there are 2 loops:. Mathematically, this is stated as - bubble sort algorithm is of O n 2 complexity. Therefore, it will take a lot of iterations for the algorithm to complete. This is undesirable. There are some better algorithms like merge sort in C , etc that take O nlog 2 n iterations. Nevertheless, bubble sort is an interesting algorithm and is a great way for beginners to understand how sorting works.

Entrepreneur, Coder, Speed-cuber, Blogger, fan of Air crash investigation! Fascinated by the world of technology he went on to build his own start-up - AllinCall Research and Solutions to build the next generation of Artificial Intelligence, Machine Learning and Natural Language Processing based solutions to power businesses.

View all posts by the Author. How Bubble sort work? If there is an N size of an array arranged in inverse order given. What will be Big O of the given Array? Please reply! How to find the difference between the sum of maximum and minimum sum of N-M elements of the given array? Write a program c to short an array using bubble sort technique plase give the algorithm. Loop invariant condition for bubble sort is that when i number of iterations right most i elements are sorted and in place. How do I merge or combine a bubble sort and a insertion sort under a single c program?

What is a C program to sort elements in ascending order using bubble sort Turbo C software? The number of exchange and the number of comparison between the elements determine the efficiency of the algorithm.

The no. Don't have an account? Sign Up. Already have an account? C and Data Structures and Algorithms. C Tutorials. Related Tutorials C. Assembly Language. Raspberry Pi. View More. Aman Goel. DSA Introduction What is an algorithm? Related Topics Selection Sort Algorithm. Working of Bubble Sort Suppose we are trying to sort the elements in ascending order. First Iteration Compare and Swap Starting from the first index, compare the first and the second elements. If the first element is greater than the second element, they are swapped.

Now, compare the second and the third elements. Swap them if they are not in order. The above process goes on until the last element. Compare the Adjacent Elements 2. Remaining Iteration The same process goes on for the remaining iterations. After each iteration, the largest element among the unsorted elements is placed at the end. Put the largest element at the end In each iteration, the comparison takes place up to the last unsorted element. Compare the adjacent elements The array is sorted when all the unsorted elements are placed at their correct positions.

Cycle Number of Comparisons 1st n-1 2nd n-2 3rd n Previous Tutorial:. Next Tutorial:. Share on:. Did you find this article helpful? Sorry about that. How can we improve it? Leave this field blank. Related Tutorials.