Class BubbleSort<T>

BubbleSort is a simple sorting algorithm that repeatedly steps through the array, compares adjacent elements and swaps them if they are in the wrong order. The pass through the array is repeated until the array is sorted.

The algorithm gets its name from the way smaller elements "bubble" to the top of the array. Although simple, it is not efficient for large datasets as it has a time complexity of O(n^2) in both the average and worst case scenarios.

The best-case time complexity is O(n) when the array is already sorted.

Example

const bubbleSort = new BubbleSort([3, 4, 1]);
bubbleSort.sort(); // returns new array with [1, 3, 4]
// or
BubbleSort.sort([3, 4, 1]); // returns new array with [1, 3, 4]
Copy

Example

const bubbleSort = new BubbleSort(
 ['alice', 'bob', 'charlie', 'alex', 'gavin'],
 (a : string, b : string) => a.localeCompare(b)
);
bubbleSort.sort(); // returns new array with ['alex', 'alice', 'bob', 'charlie', 'gavin']
Copy