Implementing Bubble Sort in C: Step-by-Step Guide with Code Example

Sorting algorithms are fundamental tools in computer science that help us organize data in a specific order. One of the simplest sorting algorithms is the Bubble Sort. In this blog post, we'll walk through the implementation of Bubble Sort in C, providing a clear step-by-step guide along with code examples.

What is Bubble Sort?

Bubble Sort is a comparison-based sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The process is repeated for each pair of adjacent elements until the entire list is sorted.

Let's dive right into the code! Here's the implementation of Bubble Sort in C:

#include <stdio.h>

int main() {

int x;

printf("Enter Array Size: ");

scanf("%d", &x); // Code_With_Tamim

int arr[100];

printf("Enter array Element: ");

for (int i = 0; i < x; i++) {

scanf("%d", &arr[i]);

}

int swap;

for (int i = 0; i < x - 1; i++) {

for (int j = 0; j < x - 1 - i; j++) {

if (arr[j] > arr[j + 1]) {

swap = arr[j];

arr[j] = arr[j + 1];

arr[j + 1] = swap;

}

}

}

printf("Sorted array is: ");

for (int i = 0; i < x; i++) {

printf("%d ", arr[i]);

}

return 0;

}