Select a sort of JavaScript implementation

Thought

The sorting algorithm of the original site comparison. That is, first find the minimum value in the number structure and place it in the first bit, and then find the second small value to place it in the second position ... And so on

Code

function selectionSort(arr) {  const length = arr.length;  for (let i = 0; i < length - 1; i++) {    let minIndex = i;    let changeOccur = false;    for (let j = i + 1 ; j < length ; j++) {      if (arr[j] < arr[minIndex]) {        minIndex = j;        changeOccur = true;      }    }    if(!changeOccur) {      break;    }    if (minIndex !== i) {      const temp = arr[i];      arr[i] = arr[minIndex];      arr[minIndex] = temp;    }      }}

Performance analysis

• Time complexity: Best O (N), average, worst O (n^2)
• Space complexity: O (1), unstable

Select a sort of JavaScript implementation