选择排序的最坏时间复杂度,选择排序的基本思想

/** *选择排序 */public class SelectSort{public void selectSort(int[] a){int len = a.length;int k, temp;for (int i = 0; i < len; i++){k = i;for (int j = k + 1; j < len; j++){if (a[k] > a[j]){k = j;}}if (k != i){temp = a[i];a[i] = a[k];a[k] = temp;}}}}