Why does my sort implementation not work?

I’m trying to sort an integer array without using sort function. I know there are other solutions available on Stack Overflow. I want to know what is wrong with my code. It performs ascending sort except for the first number in the array.

let arr = [2,4,5,1,3,7];
let iterable = true;
let iterationCount = 0;

while(iterable) {
 for(var i=iterationCount;i<=arr.length;i++) {
    if (arr[i] > arr[i+1]) {
      let temp=arr[i];
      arr[i]=arr[i+1];
      arr[i+1]=temp;
    }
 }
 iterationCount++;
 if (iterationCount == arr.length) {
    iterable = false;
 }
}

console.log(arr)

The output is [2, 1, 3, 4, 5, 7] while it should be [1, 2, 3, 4, 5, 7].

>Solution :

You could change the outer loop for keeping the last index for checking and iterate until before the last index, because in the first inner loop, the max value is now at the greatest index and any further iteration do not need to check the latest last item.

let array = [2, 4, 5, 1, 3, 7],
    iterationCount = array.length;

while (iterationCount--) {
    for (let i = 0; i < iterationCount; i++) {
        if (array[i] > array[i + 1]) {
            let temp = array[i];
            array[i] = array[i + 1];
            array[i + 1] = temp;
        }
    }
}

console.log(array);