bubble sort program in c

Bubble Sort ek simple sorting algorithm hai jo adjacent elements ko compare karta hai aur unko swap karta hai agar woh out of order hain. Ye process tab tak repeat hota hai jab tak saari elements sorted order mein nahi aajate. Yahan ek Bubble Sort program C programming language mein diya gaya hai:

```c #include

void bubbleSort(int arr[], int n) {

int temp;

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

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

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

// Swap arr[j] and arr[j+1]

temp = arr[j];

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

arr[j + 1] = temp;

}

} }

}

int main() {

int n;

printf("Enter the number of elements: ");

scanf("%d", &n);

int arr[n];

printf("Enter %d elements:\n", n);

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

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

} printf("Original array: ");

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

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

printf("\n");

bubbleSort(arr, n);

printf("Sorted array: ");

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

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

} printf("\n");

return 0;

} ``` Is program mein:

1. `bubbleSort` function mein Bubble Sort logic implement kiya gaya hai. Ye function ek array aur uske length ko arguments ke roop mein leta hai aur array ko sort karta hai.

2. `main` function mein user se array ke length aur uske elements ka input liya jata hai.

3. Original array ko print kiya jata hai.

4. `bubbleSort` function ko call kiya jata hai jisse array ko sort kiya jata hai.

5. Sorted array ko print kiya jata hai.

Is program ko compile aur run karke aap dekh sakte hain ki Bubble Sort kaise kaam karta hai. Ye ek simple sorting algorithm hai aur small to medium-sized arrays ko sort karne ke liye istemal kiya ja sakta hai, lekin large arrays ke liye efficiency kam hoti hai.