Bubble Sort In C

In this blog, I'm going to explain about Bubble sort.

Introduction

• In this blog, I am going to explain about Bubble sort to sort the numbers or arrange them in an ascending order.

Software Requirements:

• Turbo C++ or C. 

Programming

#include < stdio.h >
int main()
{
    int array[100], n, c, d, swap;
    printf("Enter number of elements\n");
    scanf("%d", & n);
    printf("Enter %d integers\n", n);
    for (c = 0; c < n; c++) scanf("%d", & array[c]);
    for (c = 0; c < (n - 1); c++) {
        for (d = 0; d < n - c - 1; d++) {
            if (array[d] > array[d + 1]) {
                swap = array[d];
                array[d] = array[d + 1];
                array[d + 1] = swap;
            }
        }
    }
    printf("Sorted list in ascending order:\n");
    for (c = 0; c < n; c++) printf("%d\n", array[c]);
    return 0;
}

Explanation

•  In the programming, given above, it is clearly understood how to do Bubble sort in a simple manner by using for loop and if condition.
  
  
  
  
  

Output

 

 

Conclusion

• Thus, the program can be executed and printed successfully.