Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * 选择排序,时间复杂度O(n^2),空间复杂度O(1)
- * @param {Array} arr 需要进行排序的数组
- * @return {Array} arr 排序完成后的数组
- */
- function selectionSort(arr) {
- if(Object.prototype.toString.call(arr) === "[object Array]") {
- var len = arr.length;
- var minIndex, temp;
- for(var i=0; i<len-1; i++) {
- minIndex = i;
- for(var j=i+1; j<len; j++) {
- if(arr[j] < arr[minIndex]) {
- minIndex = j;
- }
- }
- temp = arr[i];
- arr[i] = arr[minIndex];
- arr[minIndex] = temp;
- }
- return arr;
- } else {
- return 'not array';
- }
- }
Add Comment
Please, Sign In to add comment