GolangSortingVisualization
GolangSortingVisualization copied to clipboard
examples of various sorting algorithms in golang (with visualization)
https://en.wikipedia.org/wiki/Block_sort Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) in-place stable sorting....
https://en.wikipedia.org/wiki/Timsort Timsort is a hybrid stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It was implemented by Tim...
https://en.wikipedia.org/wiki/Cubesort Cubesort is a parallel sorting algorithm that builds a self-balancing multi-dimensional array from the keys to be sorted. As the axes are of similar length the structure resembles a...
https://en.wikipedia.org/wiki/Tree_sort A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements...
https://en.wikipedia.org/wiki/Library_sort Library sort, or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with gaps in the array to accelerate subsequent insertions.
https://en.wikipedia.org/wiki/Patience_sorting In computer science, patience sorting is a sorting algorithm inspired by, and named after, the card game patience. A variant of the algorithm efficiently computes the length of a...
https://en.wikipedia.org/wiki/Smoothsort In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981.
https://en.wikipedia.org/wiki/Introsort Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance. It begins with quicksort, it switches to heapsort when...
https://github.com/SimonWaldherr/GolangSortingVisualization/blob/master/gsv.go#L149