BubbleSort
This commit is contained in:
38
BubbleSort.c
Normal file
38
BubbleSort.c
Normal file
@@ -0,0 +1,38 @@
|
||||
// WAP to sort an array using bubble sort.
|
||||
|
||||
void main() {
|
||||
int array[10], n, c, d, swap;
|
||||
|
||||
// To set range of array:
|
||||
printf("\n Enter the range of array: \n");
|
||||
scanf("%d", &n);
|
||||
|
||||
// To get values of array:
|
||||
printf("\n Enter the elements of the array: \n");
|
||||
for (c=0 ; c<=n; c++) {
|
||||
scanf("%d \n", &array[c]);
|
||||
}
|
||||
|
||||
// To print the elements of the insorted array:
|
||||
printf("\n The elements of the unsorted array are: \n");
|
||||
for (c=0 ; c<=n; c++) {
|
||||
printf("%d \n", array[c]);
|
||||
}
|
||||
|
||||
// Bubble Ssort algorithm:
|
||||
for (c=0 ; c<=n-1; c++) {
|
||||
for (d=0; d<n-c-1; d++) {
|
||||
if (array[d] > array[d+1]) {
|
||||
swap = array[d+1];
|
||||
array[d] = array[d+1];
|
||||
array[d+1] = swap;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// To print the elements of the sorted array:
|
||||
printf("\n The elements of the sorted array are: \n");
|
||||
for (c=0 ; c<=n; c++) {
|
||||
printf("\n %d \n", array[c]);
|
||||
}
|
||||
}
|
||||
BIN
BubbleSort.exe
Normal file
BIN
BubbleSort.exe
Normal file
Binary file not shown.
@@ -25,4 +25,5 @@
|
||||
|23 | MultiplicationTable.c | MultiplicationTable.exe | WAP to print the multiplication table for a given number |
|
||||
|24 | Divisible.c | Divisible.exe | WAP to find an addition of numbers which are >30, <100 & divisible by 7 |
|
||||
|25 | Array.c | Array.exe | WAP to print out an array of dynamic values |
|
||||
|26 | ArrayReverse.c | ArrayReverse.exe | WAP to print out an array of dynamic values in reverse order |
|
||||
|26 | ArrayReverse.c | ArrayReverse.exe | WAP to print out an array of dynamic values in reverse order |
|
||||
|27 | BubbleSort.c | BubbleSort.exe | WAP to sort an array using bubble sort |
|
||||
Reference in New Issue
Block a user