-
Notifications
You must be signed in to change notification settings - Fork 166
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Create Sorting algorithm in C by Suryansh Sinha
- Loading branch information
1 parent
07f32cd
commit 1eadd01
Showing
1 changed file
with
55 additions
and
0 deletions.
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,55 @@ | ||
// C program to sort the array in an | ||
// ascending order using selection sort | ||
|
||
#include <stdio.h> | ||
|
||
void swap(int* xp, int* yp) | ||
{ | ||
int temp = *xp; | ||
*xp = *yp; | ||
*yp = temp; | ||
} | ||
|
||
// Function to perform Selection Sort | ||
void selectionSort(int arr[], int n) | ||
{ | ||
int i, j, min_idx; | ||
|
||
// One by one move boundary of unsorted subarray | ||
for (i = 0; i < n - 1; i++) { | ||
|
||
// Find the minimum element in unsorted array | ||
min_idx = i; | ||
for (j = i + 1; j < n; j++) | ||
if (arr[j] < arr[min_idx]) | ||
min_idx = j; | ||
|
||
// Swap the found minimum element | ||
// with the first element | ||
swap(&arr[min_idx], &arr[i]); | ||
} | ||
} | ||
|
||
// Function to print an array | ||
void printArray(int arr[], int size) | ||
{ | ||
int i; | ||
for (i = 0; i < size; i++) | ||
printf("%d ", arr[i]); | ||
printf("\n"); | ||
} | ||
|
||
// Driver code | ||
int main() | ||
{ | ||
int arr[] = { 0, 23, 14, 12, 9 }; | ||
int n = sizeof(arr) / sizeof(arr[0]); | ||
printf("Original array: \n"); | ||
printArray(arr, n); | ||
|
||
selectionSort(arr, n); | ||
printf("\nSorted array in Ascending order: \n"); | ||
printArray(arr, n); | ||
|
||
return 0; | ||
} |