C/SelectionSort.c
void selectionSort(int arrayOfNumbers[], int numOfNum)
{
    for (int i = 0; i < numOfNum - 1; i++)              // The actual algorithm is here
        for (int j = i + 1; j < numOfNum; j++)
            if (arrayOfNumbers[i] > arrayOfNumbers[j])
                swap(&arrayOfNumbers[i], &arrayOfNumbers[j]);
}
/* We pass the array to this function to apply selection sort. */
We pass the array to this function to apply selection sort.
We pass the array to this function to apply selection sort .
void selectionSort(int arrayOfNumbers[], int numOfNum)
{
    for (int i = 0; i < numOfNum - 1; i++)              
        for (int j = i + 1; j < numOfNum; j++)
            if (arrayOfNumbers[i] > arrayOfNumbers[j])
                swap(&arrayOfNumbers[i], &arrayOfNumbers[j]);
}
void selectionSort ( int arrayOfNumbers [ ] , int numOfNum ) { for ( int i = 0 ; i < numOfNum - 1 ; i ++ ) for ( int j = i + 1 ; j < numOfNum ; j ++ ) if ( arrayOfNumbers [ i ] > arrayOfNumbers [ j ] ) swap ( & arrayOfNumbers [ i ] , & arrayOfNumbers [ j ] ) ; }
We pass the array to this function to apply selection sort.
We pass the array to this function to apply selection sort .
// The actual algorithm is here