Tuesday, May 12, 2015

Selection Sort


It is a simplest algorithm.
First look for the minimum in the array and then swap that element with the 0th position. Then find the second minimum element and swap with the index 1 element and so on.


SelectionSort ( A , n ) 
{
      for i <--- 0 to n-2
       {
            min <-- i
            for j <--- i+1 to n-1
             {
                   if ( A[i] <  A[min] )
                           min <--- j
                   
                    temp <-- A[i]
                    A[i] <--- A[min]
                    A[min] <-- temp
              }
        }
}

0 comments:

Post a Comment