-
Notifications
You must be signed in to change notification settings - Fork 32
/
Copy pathsorting.c
49 lines (38 loc) · 1.06 KB
/
sorting.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <stdio.h>
void bubbleSort(int arr[], int n) {
int temp;
int swapped;
for (int i = 0; i < n - 1; i++) {
swapped = 0; // Initialize the swapped flag to 0
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;
swapped = 1; // Set the swapped flag to 1
}
}
// If no two elements were swapped in the inner loop, the array is already sorted
if (swapped == 0) {
break;
}
}
}
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]);
}
bubbleSort(arr, n);
printf("Sorted array:\n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}