mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-25 06:49:36 +03:00
Create sortingnewmethod.c
This commit is contained in:
parent
e5dad3fa8d
commit
588ab770f3
22
data_structures/sortingnewmethod.c
Normal file
22
data_structures/sortingnewmethod.c
Normal file
@ -0,0 +1,22 @@
|
|||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
void bubbleSort(int arr[], int n) {
|
||||||
|
for (int i = 0; i < n - 1; i++) {
|
||||||
|
for (int j = 0; j < n - i - 1; j++) {
|
||||||
|
if (arr[j] > arr[j + 1]) {
|
||||||
|
int temp = arr[j];
|
||||||
|
arr[j] = arr[j + 1];
|
||||||
|
arr[j + 1] = temp;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
int arr[] = {64, 25, 12, 22, 11};
|
||||||
|
int n = sizeof(arr) / sizeof(arr[0]);
|
||||||
|
bubbleSort(arr, n);
|
||||||
|
printf("Sorted array: ");
|
||||||
|
for (int i = 0; i < n; i++) printf("%d ", arr[i]);
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user