Guest User

Untitled

a guest
Mar 23rd, 2018
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. /**
  2. * 选择排序,时间复杂度O(n^2),空间复杂度O(1)
  3. * @param {Array} arr 需要进行排序的数组
  4. * @return {Array} arr 排序完成后的数组
  5. */
  6. function selectionSort(arr) {
  7. if(Object.prototype.toString.call(arr) === "[object Array]") {
  8. var len = arr.length;
  9. var minIndex, temp;
  10. for(var i=0; i<len-1; i++) {
  11. minIndex = i;
  12. for(var j=i+1; j<len; j++) {
  13. if(arr[j] < arr[minIndex]) {
  14. minIndex = j;
  15. }
  16. }
  17. temp = arr[i];
  18. arr[i] = arr[minIndex];
  19. arr[minIndex] = temp;
  20. }
  21. return arr;
  22. } else {
  23. return 'not array';
  24. }
  25. }
Add Comment
Please, Sign In to add comment