proxy.golang.org : github.com/delaneyj/timsort
Package timsort provides fast stable sort, uses external comparator. A stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when running on partially sorted arrays, while offering performance comparable to a traditional mergesort when run on random arrays. Like all proper mergesorts, this sort is stable and runs O(n log n) time (worst case). In the worst case, this sort requires temporary storage space for n/2 object references; in the best case, it requires only a small constant amount of space. This implementation was derived from Java's TimSort object by Josh Bloch, which, in turn, was based on the original code by Tim Peters: http://svn.python.org/projects/python/trunk/Objects/listsort.txt Mike K.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/delaneyj/timsort
License: MIT
Status: removed
Latest release: 5 months ago
Namespace: github.com/delaneyj
Stars: 78 on GitHub
Forks: 12 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 5 months ago