7 packages returned for Tags:"Radix"

C# implementation of a Trie (prefix tree) that is IEnumerable. You may conduct a prefix tree and not have to run on the trie all the way to it's end - just for the amount of results you need. This is perfect for autocomplete or any other scenario where you may want a fixed amount of results yielded... More information
High performance, cross-platform C#/.NET algorithms. Much improved .Sum(). Sort algorithms: parallel, serial, in-place, stable, O(N) Radix LSD/MSD, Merge. Histogram, Priority Queue, Merge, Fill, Min/Max, more... Familiar interfaces.