selection_sort.c
sorting Implementation
41 lines801 bytesC
1// Selection Sort
2#include <stdio.h>
3
4void selectionSort(int arr[], int n) {
5 for (int i = 0; i < n - 1; i++) {
6 int minIdx = i;
7 for (int j = i + 1; j < n; j++) {
8 if (arr[j] < arr[minIdx]) {
9 minIdx = j;
10 }
11 }
12 if (minIdx != i) {
13 int temp = arr[i];
14 arr[i] = arr[minIdx];
15 arr[minIdx] = temp;
16 }
17 }
18}
19
20void display(int arr[], int n) {
21 for (int i = 0; i < n; i++) {
22 printf("%d ", arr[i]);
23 }
24 printf("\n");
25}
26
27int main() {
28 int arr[] = {64, 25, 12, 22, 11};
29 int n = sizeof(arr) / sizeof(arr[0]);
30
31 printf("Original array: ");
32 display(arr, n);
33
34 selectionSort(arr, n);
35
36 printf("Sorted array: ");
37 display(arr, n);
38
39 return 0;
40}
41