boristane/arr-sorting

Sort an array using various popular sorting algorithms.

arr-sorting's Issues

Add support for shell sort

Sorts an array using the shell sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
shell(arr); // [2, 5, 5, 6, 10, 32]
shell(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Add support for introsort

Sorts an array using the introsort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
intro(arr); // [2, 5, 5, 6, 10, 32]
intro(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Reference

Update README.md.

Implement the Hoare partition scheme for quick sort

The current quick sort function uses the Lamuto partition scheme. The Hoare partition scheme is more efficient and would be a good enhancement.

Add support for smooth sort

Sorts an array using the smooth sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
smooth(arr); // [2, 5, 5, 6, 10, 32]
smooth(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Edit README

Edit README to explain each algorithm.

Add support for quick sort

Sorts an array using the quick sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
quick(arr); // [2, 5, 5, 6, 10, 32]
quick(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Add support for tree sort

Sorts an array using the tree sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
tree(arr); // [2, 5, 5, 6, 10, 32]
tree(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Add support for timsort

Sorts an array using the timsort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
tim(arr); // [2, 5, 5, 6, 10, 32]
tim(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Reference

Update README.md.

Add support for binary sort

Sorts an array using the binary sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
binary(arr); // [2, 5, 5, 6, 10, 32]
binary(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Reference.

Update README.md.

Add support for merge sort

Sorts an array using the merge sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
merge(arr); // [2, 5, 5, 6, 10, 32]
merge(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Add support for selection sort

Sorts an array using the selection sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
selection(arr); // [2, 5, 5, 6, 10, 32]
selection(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Add support for insertion sort

Sorts an array using the insertion sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
insertion(arr); // [2, 5, 5, 6, 10, 32]
insertion(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.

Add support for heap sort

Sorts an array using the heap sort algorithm.

const arr = [2, 5, 10, 5, 32, 6];
heap(arr); // [2, 5, 5, 6, 10, 32]
heap(arr, (a, b) => b - a); // [32, 10, 6, 5, 5, 2]

Update README.md.