Selection Sort

#include <stdio.h> 

void swap(int *xp, int *yp)

{

    int temp = *xp;

    *xp = *yp;

    *yp = temp;

}

void selectionSort(int arr[], int n)

{

    int i, j, min_index;

     One by one move boundary of unsorted subarray

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

    {

         Find the minimum element in unsorted array

        min_index = i;

        for (j = i+1; j < n; j++)

          if (arr[j] < arr[min_index])

            min_index = j;

         Swap the found minimum element with the first element

        swap(&arr[min_index], &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");

}

int main()

{

    int arr[] = {64, 25, 12, 22, 11};

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

    selectionSort(arr, n);

    printf("Sorted array: \n");

    printArray(arr, n);

    return 0;

}