zigtimsort

Sorting algorithm

An implementation of a hybrid sorting algorithm with a focus on stability and adaptability

TimSort implementation for Zig

GitHub

6 stars
2 watching
0 forks
Language: Zig
last commit: about 6 years ago
Linked from 2 awesome lists


Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
addyosmani/bubblesortA bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order107
timsort/cpp-timsortA C++ implementation of TimSort, an O(n log n) stable sorting algorithm.303
mattreecebentley/plf_indiesortA sorting algorithm that optimizes performance on non-random access containers and large data types19
tomhoule/zig-diffA Zig library for generating text diffs using Myers' diff algorithm.13
stoeffel/mergesortAn efficient sorting algorithm with O(n log n) complexity.20
scandum/blitsortAn in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management703
mdsteele/ziegfriedA general-purpose memory allocator for the Zig programming language.24
zig-java/jazA JVM implementation in Zig.88
felix-petersen/diffsortA library that allows gradients to be propagated through sorting operations, enabling differentiable sorting networks.107
bonzaithepenguin/wikisortAn optimized sorting algorithm with O(1) memory usage.1,273
jfcg/sortyFast and efficient sorting library for Go with concurrent and parallel capabilities133
dutchghost/maybeuninitA Zig library implementing a way to create and manage uninitialized values at compile-time.1
ziglibs/diffzA Zig library implementing a diff-matching algorithm22
deatil/zig-md2A Zig implementation of the MD2 hash function algorithm1
jedisct1/zig-minisignAn implementation of Minisign in Zig.55