function selectionSort(arr){

    for(let i = 0; i<arr.length; i++){

      //find min number in subarray 

      //and place it at ith position

        let minptr = i;

        for(let j = i+1; j<arr.length; j++){

            if(arr[minptr] > arr[j]){

                minptr = j;

            }

        }

      //swap

        let temp = arr[i];

        arr[i] = arr[minptr];

        arr[minptr] = temp;

    }

    return arr;

}

​

let a = [99,44,6,2,1,5,63,87,283,4,0];

console.log(selectionSort(a));

/*

This is an implementation of the selection sort

algorithm.

Idea is to sort a list by successively putting

each value in its final sorted position.

​

Let n be the size of the list to sort

​

Time complexity: O(n^2),

Space complexity: O(1)

*/

function selectionSort(arr) {

  let min;

  // idx is position to fill up with next smallest value

  for (let idx = 0; idx < arr.length - 1; idx++) {

    min = idx;

    // Look for next smallest value in rest of array

    for (let scan = idx + 1; scan < arr.length; scan++) {

      if (arr[scan] < arr[min]) {

        min = scan;

      }

    }

    // Exchange current value with the next smallest value

    swap(arr, idx, min);

  }

}

function swap(arr, i, j) {

  const temp = arr[i];

  arr[i] = arr[j];

  arr[j] = temp;

}

const arr = [1, 10, 3, 2];

selectionSort(arr);

console.log(arr); // [ 1, 2, 3, 10 ]

//selection sort javascript

​

function selectionSort(arr){

    for(let i = 0; i<arr.length; i++){

        let minptr = i;

        for(let j = i+1; j<arr.length; j++){

            if(arr[minptr] > arr[j]){

                minptr = j;

            }

        }

      //swap

        let temp = arr[i];

        arr[i] = arr[minptr];

        arr[minptr] = temp;

    }

    return arr;

}

​

let a = [99,44,6,2,1,5,63,87,283,4,0];

console.log(selectionSort(a));

​

​

//selection sort javascript

​

const selectionSort = array => {

  const arr = Array.from(array); // avoid side effects

  for (let i = 0; i < arr.length - 1; i++) {

    let minPos = i;

    for (let j = i + 1; j < arr.length; j++) {

      if (arr[j] < arr[minPos]) {

        minPos = j;

      }

    }

    if (i !== minPos) {

      [arr[i], arr[minPos]] = [arr[minPos], arr[i]];

    }

  }

  return arr;

};

​

console.log(selectionSort([4, 9, 2, 1, 5]));