Introduction - New Jersey Institute of Technology



Selection Sort

In selection sorting algorithm, find the minimum value in the array then swap it first position. In next step leave the first value and find the minimum value within remaining values. Then swap it with the value of minimum index position. Sort the remaining values by using same steps. Selection sort is probably the most intuitive sorting algorithm to invent. 

The complexity of selection sort algorithm is in worst-case, average-case, and best-case run-time of Ω (n2), assuming that comparisons can be done in constant time.  

Code description:

• First assign minimum index in key (index_of_min=x).

• Then find the minimum value and assign the index of minimum value in key (index_of_min=y).

• Then swap the minimum value with the value of minimum index. 

• At next iteration leave the value of minimum index position and sort the remaining values by following same steps.

Working of the selection sort algorithm:

Say we have an array unsorted A[0],A[1],A[2]................ A[n-1] and A[n] as input. Then the following steps are followed by selection sort algorithm to sort the values of an array. (Say we have a key index_of_min that indicate the position of minimum value)

1.Initaily varaible  index_of_min=0;

2.Find the minimum value in the unsorted array.

3.Assign the index of the minimum value into index_of_min variable.

4.Swap minimum value to first position.

5.Sort the remaining values of array (excluding the first value).

The code of the program :

|public class selectionSort{ |

|  public static void main(String a[]){ |

|    int i; |

|    int array[] = {12,9,4,99,120,1,3,10}; |

|    System.out.println("\n\n       RoseIndia\n\n"); |

|    System.out.println("       Selection Sort\n\n");    |

|    System.out.println("Values Before the sort:\n");     |

|    for(i = 0; i  ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download