Created
November 17, 2018 15:12
-
-
Save jamesgeorge007/f64b2242a1eb941ba1c08efd2bf16d73 to your computer and use it in GitHub Desktop.
Various sorting techniques available in C
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int main() | |
{ | |
int arr[25], n, i, j, temp; | |
printf("\n Number of elements: "); | |
scanf("%d", &n); | |
printf("\nEnter the elements: "); | |
for(i = 0;i < n; i++) | |
scanf("%d", &arr[i]); | |
for(i=0;i<n-1;i++) | |
{ | |
for(j=0;j<n-i-1;j++) | |
{ | |
if(arr[j] > arr[j+1]) | |
{ | |
temp = arr[j]; | |
arr[j] = arr[j+1]; | |
arr[j+1] = temp; | |
} | |
} | |
} | |
printf("\nElements in the (Ascending) sorted order are: "); | |
for(i = 0;i < n; i++) | |
printf("%d ", arr[i]); | |
return 0; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int main() | |
{ | |
int arr[25], i, j, n, temp; | |
printf("\n Number of elements: "); | |
scanf("%d", &n); | |
printf("\nEnter the elements: "); | |
for(i = 0;i < n; i++) | |
scanf("%d", &arr[i]); | |
for(i = 0; i<n-1; i++) | |
{ | |
for(j = i+1; j<n; j++) | |
{ | |
if(arr[j] < arr[i]) | |
{ | |
temp = arr[j]; | |
arr[j] = arr[i]; | |
arr[i] = temp; | |
} | |
} | |
} | |
printf("\nElements in the (Ascending) sorted order are: "); | |
for(i = 0;i < n; i++) | |
printf("%d ", arr[i]); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment