Algorithm—Selection Sort

      Now let me intrduce the SelectionSort algorithm for u,SelectionSort is something easy that u can write it as soon as posible,let's write it following:

 

       /// <summary><br /> /// Selection Sort Method<br /> /// </summary><br /> /// <param name="data"></param><br /> /// <param name="count"></param><br /> public void SelectionSort(int[] data, int count)<br /> {<br /> int min, temp;<br /> for (int i = 0; i < count - 1; i++)<br /> {<br /> //assume the first num is the min one<br /> min = i;<br /> for (int j = i + 1; j < count; j++)<br /> {<br /> //loop for get the min one<br /> if (data[min] > data[j])<br /> {<br /> min = j;<br /> }<br /> }<br /> //swap data[i] and data[min]<br /> if (min != i)<br /> {<br /> temp = data[i];<br /> data[i] = data[min];<br /> data[min] = temp;<br /> }<br /> }<br /> }

 

Easy, Simply

Over!