本文實(shí)例講述了C#選擇法排序?qū)崿F(xiàn)方法。分享給大家供大家參考。具體實(shí)現(xiàn)方法如下：
public int[] SelectionSort(int[] arr){ //1. Find min //2. Swap it with first element //3. Repeat starting from secong position onwards. int _min = 0; for (int i = 0; i < arr.Length; i++) { _min = i; for (int j = i; j < arr.Length; j++) { if (arr[j] < arr[_min]) _min = j; } int _temp = arr[i]; arr[i] = arr[_min]; arr[_min] = _temp; } return arr;}希望本文所述對(duì)大家的C#程序設(shè)計(jì)有所幫助。
新聞熱點(diǎn)
疑難解答
圖片精選
