bubble_sort.c
sorting Implementation
40 lines807 bytesC
1// Bubble Sort
2#include <stdio.h>
3
4void bubbleSort(int arr[], int n) {
5 for (int i = 0; i < n - 1; i++) {
6 int swapped = 0;
7 for (int j = 0; j < n - i - 1; j++) {
8 if (arr[j] > arr[j + 1]) {
9 int temp = arr[j];
10 arr[j] = arr[j + 1];
11 arr[j + 1] = temp;
12 swapped = 1;
13 }
14 }
15 if (!swapped) break;
16 }
17}
18
19void display(int arr[], int n) {
20 for (int i = 0; i < n; i++) {
21 printf("%d ", arr[i]);
22 }
23 printf("\n");
24}
25
26int main() {
27 int arr[] = {64, 34, 25, 12, 22, 11, 90};
28 int n = sizeof(arr) / sizeof(arr[0]);
29
30 printf("Original array: ");
31 display(arr, n);
32
33 bubbleSort(arr, n);
34
35 printf("Sorted array: ");
36 display(arr, n);
37
38 return 0;
39}
40