Selection Sort

Here we analyze the selection sort algorithm, which repeatedly indentifies the smallest remaining unsorted element and puts it at the end of the sorted of the array.

 

Selection_Sort(int s[], int n)
{
        int i,j;
        int min;

        for(i = 0; i < n; i++)
        {
              min = i;
              for(j = i + 1; j < n; j++)
                  if(s[j] < s[min])
                      min = j;
            
              Swap(&s[i], &s[min]);
         }
}