๐ผ Explanation of Bubble Sort :
๐ป CODE :
function bubbleSort(array) {
let isSorted = false;
let arrayLength = array.length - 1;
let temp;
while (!isSorted) {
isSorted = true;
for (let i = 0; i < arrayLength; i++) {
if (array[i] > array[i + 1]) {
temp = array[i + 1];
array[i + 1] = array[i];
array[i] = temp;
isSorted = false;
}
}
arrayLength--;
}
}
Time Complexity:
- Best: ฮฉ(N)
- Average: ฮ(Nยฒ)
- Worst: ฮ(Nยฒ)
Space Complexity:
- ฮ(1)
Top comments (0)