Skip to content

Commit

Permalink
Create Sorting algorithm in C by Suryansh Sinha
Browse files Browse the repository at this point in the history
  • Loading branch information
SuryanshSinha2612 committed Oct 2, 2022
1 parent 07f32cd commit 1eadd01
Showing 1 changed file with 55 additions and 0 deletions.
55 changes: 55 additions & 0 deletions C/Sorting algorithm in C by Suryansh Sinha
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;
}

0 comments on commit 1eadd01

Please sign in to comment.