Selection Sort

1. #include <stdio.h>

2. 
   

3. // Function to perform Selection Sort

4. void selectionSort(int arr[], int n) {

5.     int i, j, min_idx, temp;

6.     // Move the boundary of the unsorted subarray

7.     for (i = 0; i < n-1; i++) {

8.         // Find the index of the minimum element in the unsorted part

9.         min_idx = i;

10.         for (j = i+1; j < n; j++) {

11.             if (arr[j] < arr[min_idx]) {

12.                 min_idx = j;

13.             }

14.         }

15.         // Swap the found minimum element with the first element of unsorted part

16.         if (min_idx != i) {

17.             temp = arr[i];

18.             arr[i] = arr[min_idx];

19.             arr[min_idx] = temp;

20.         }

21.     }

22. }

23. 
    

24. // Function to print an array

25. void printArray(int arr[], int n) {

26.     for (int i = 0; i < n; i++)

27.         printf("%d ", arr[i]);

28.     printf("\n");

29. }

30. 
    

31. int main() {

32.     int arr[] = {29, 10, 14, 37, 13};

33.     int n = sizeof(arr) / sizeof(arr[0]);

34. 
    

35.     printf("Original array:\n");

36.     printArray(arr, n);

37. 
    

38.     selectionSort(arr, n);

39. 
    

40.     printf("Sorted array:\n");

41.     printArray(arr, n);

42. 
    

43.     return 0;

44. }

45.