Bubble Sort

Write a function that takes in an array of integers and returns a sorted version of that array. Use the Bubble Sort algorithm to sort the array.

If you're unfamiliar with Bubble Sort, we recommend watching the Conceptual Overview section of this question's video explanation before starting to code.

Sample Input

array = [8, 5, 2, 9, 5, 6, 3]

array = [8, 5, 2, 9, 5, 6, 3]

Sample Output

[2, 3, 5, 5, 6, 8, 9]

[2, 3, 5, 5, 6, 8, 9]

Hints

Hint 1

Traverse the input array, swapping any two numbers that are out of order and keeping track of any swaps that you make. Once you arrive at the end of the array, check if you have made any swaps; if not, the array is sorted and you are done; otherwise, repeat the steps laid out in this hint until the array is sorted.

Optimal Space & Time Complexity

Best: O(n) time | O(1) space - where n is the length of the input array Average: O(n^2) time | O(1) space - where n is the length of the input array Worst: O(n^2) time | O(1) space - where n is the length of the input array

// O(n^2) time complexity
function bubbleSort(array) {
  let isSorted = false;
	let counter = 1
	while (!isSorted) {
		isSorted = true;
		for (let i = 0; i < array.length - counter; i++) {
			if (array[i] > array[i+1]) {
				isSorted = false;
				[array[i], array[i+1]] = [array[i+1], array[i]];
			}
		}
		counter++;
	}
	return array
}

// O(n^2) time complexity
function bubbleSort(array) {
  let isSorted = false;
	let counter = 1
	while (!isSorted) {
		isSorted = true;
		for (let i = 0; i < array.length - counter; i++) {
			if (array[i] > array[i+1]) {
				isSorted = false;
				[array[i], array[i+1]] = [array[i+1], array[i]];
			}
		}
		counter++;
	}
	return array
}

🐿