Bubble sorting in C

Sort is a necessary concept that we need to learn in any programming language. Most sorting is done on arrays involving numbers and is a stepping stone to master the techniques of traversing and accessing data in arrays.
The sorting technique type we are going to discuss in today’s article is bubble sorting.

Bubble sort

Bubble sorting is a simple sorting algorithm that works by repeatedly exchanging adjacent elements if the order of adjacent elements is incorrect. This array sorting method is not suitable for large datasets because the time complexity is very high in average and worst-case scenarios.

Bubble sorting algorithm:

1. Bubble sorting organizes arrays by sorting multiple times.
2. First pass: The largest element moves to the last position, its correct position.
3. Second pass: The second largest element moves to the penultimate position and continues to follow-up passes.
4. Each time you pass, only the unsorted parts of the array are processed.
5. After k passes, the largest k elements are in the correct position in the last k slots.
6. During each pass:
   • Compare adjacent elements in unsorted sections.
   • If a larger element appears before a smaller element, the element is swapped.
   • At the end of the traversal, the largest unsorted element moves to the correct position. Repeat this process until the entire array is sorted.

How does bubble sort work?

Below is the implementation of bubble sorting. If the inner loop does not cause any exchange, it can be optimized by stopping the algorithm.

 // Easy implementation of Bubble sort
#include <stdio.h>
int main(){
    int i, j, size, temp, count=0, a[100];
    //Asking the user for size of array
    printf("Enter the size of array you want to enter = \t");
    scanf("%d", &size);
    // taking the input array through loop
    for (i=0;i<size printf the element scanf unsorted list you entered is : for i size count="1;" j if> a[j 1]) {
                //swapping elements
                temp=a[j];
                a[j]=a[j 1];
                a[j 1]=temp;
                count = 1;
            }
        }

        // If no two elements were swapped by inner loop,
        // then break
        if (count == 1)
            break;
    }
    // printing the sorted list
    printf("\nThe sorted list is : \n");
    for (i=0;i<size printf return><h2 id="Output">Output:</h2>
<p> ** <img src="/static/imghw/default1.png" data-src="https://img.php.cn/upload/article/001/246/273/173284165217950.jpg" class="lazy" alt="Bubble sorting in C"></p>
<h2 id="Complexity-analysis-of-bubble-sorting"> Complexity analysis of bubble sorting:</h2>
<p> Time complexity: o(n2)<br> Auxiliary space: o(1)</p>
<h2 id="Advantages-of-Bubble-Sort"> Advantages of Bubble Sort:</h2>
<ul>
<li> Bubble sorting is easy to understand and implement.</li>
<li> No additional memory space is required.</li>
<li> It is a stable sorting algorithm, which means that elements with the same key value maintain their relative order in the sorting output.</li>
</ul>
<h2 id="Disadvantages-of-Bubble-Sort"> Disadvantages of Bubble Sort:</h2>
<ul>
<li> The time complexity of bubble sort is o(n2), which makes it very slow for large datasets.</li>
<li> Bubble sorting is a comparison-based sorting algorithm, meaning it requires a comparison operator to determine the relative order of elements in the input dataset. In some cases it limits the efficiency of the algorithm.</li>
</ul>
<p> If you have any questions, please comment! !<br> All discussions will be appreciated :)</p></size></size></stdio.h>

The above is the detailed content of Bubble sorting in C. For more information, please follow other related articles on the PHP Chinese website!