https://github.com/juliacollections/sortingalgorithms.jl
extra sorting algorithms extending Julia's sorting API
https://github.com/juliacollections/sortingalgorithms.jl
Last synced: 4 months ago
JSON representation
extra sorting algorithms extending Julia's sorting API
- Host: GitHub
- URL: https://github.com/juliacollections/sortingalgorithms.jl
- Owner: JuliaCollections
- License: other
- Created: 2013-09-18T04:38:38.000Z (almost 12 years ago)
- Default Branch: main
- Last Pushed: 2024-11-24T16:36:18.000Z (8 months ago)
- Last Synced: 2025-02-21T06:16:17.064Z (5 months ago)
- Language: Julia
- Homepage:
- Size: 784 KB
- Stars: 54
- Watchers: 17
- Forks: 27
- Open Issues: 14
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# Sorting Algorithms
[](https://github.com/JuliaLang/SortingAlgorithms.jl/actions?query=workflow%3ACI+branch%3Amaster)
[](https://coveralls.io/r/JuliaLang/SortingAlgorithms.jl)
[](https://juliahub.com/ui/Packages/SortingAlgorithms/6dCmw?t=2)
The `SortingAlgorithms` package provides four sorting algorithms that can be used with Julia's [standard sorting API](https://docs.julialang.org/en/v1/base/sort/):
- [HeapSort] – an unstable, general purpose, in-place, O(n log n) comparison sort that works by heapifying an array and repeatedly taking the maximal element from the heap.
- [TimSort] – a stable, general purpose, hybrid, O(n log n) comparison sort that adapts to different common patterns of partially ordered input data.
- [CombSort] – an unstable, general purpose, in-place, O(n log n) comparison sort with O(n^2) pathological cases that can attain good efficiency through SIMD instructions and instruction level parallelism on modern hardware.
- [PagedMergeSort] – a stable, general purpose, O(n log n) time and O(sqrt n) space comparison sort.
[HeapSort]: https://en.wikipedia.org/wiki/Heapsort
[TimSort]: https://en.wikipedia.org/wiki/Timsort
[CombSort]: https://en.wikipedia.org/wiki/Comb_sort
[PagedMergeSort]: https://link.springer.com/chapter/10.1007/BFb0016253
## Usage
```jl
julia> using SortingAlgorithms
julia> words = map(chomp,[readlines(open("/usr/share/dict/words"))...])
235886-element Array{ASCIIString,1}:
"A"
"a"
"aa"
⋮
"zythum"
"Zyzomys"
"Zyzzogeton"
julia> sort!(words, alg=TimSort)
235886-element Array{ASCIIString,1}:
"A"
"Aani"
"Aaron"
⋮
"zymurgy"
"zythem"
"zythum"
julia> sort!(words, alg=TimSort, by=length)
235886-element Array{ASCIIString,1}:
"A"
"B"
"C"
⋮
"scientificophilosophical"
"tetraiodophenolphthalein"
"thyroparathyroidectomize"
julia> sort!(words, alg=HeapSort)
235886-element Array{ASCIIString,1}:
"A"
"Aani"
"Aaron"
⋮
"zymurgy"
"zythem"
"zythum"
julia> sort!(words, alg=HeapSort, by=length)
235886-element Array{ASCIIString,1}:
"L"
"p"
"U"
⋮
"scientificophilosophical"
"tetraiodophenolphthalein"
"thyroparathyroidectomize"
julia> sort!(randn(1000), alg=CombSort)
1000-element Array{Float64,1}:
-2.86255
-2.72041
-2.58234
⋮
3.15075
3.20058
3.23942
```
## Other packages that provide sorting algorithms
While SortingAlgorithms.jl is the most widely used sorting package in the Julia ecosystem, other packages are available:
- https://github.com/xiaodaigh/SortingLab.jl
- https://github.com/JeffreySarnoff/SortingNetworks.jl
- https://github.com/nlw0/ChipSort.jl