QuillSort — A data sorter
Most of the time, Python’s built-in sorted() and list.sort() are all you need. But if you ever try to sort a lot of data—millions to billions of values, big numeric logs, or giant SQL exports—you q...
Source: DEV Community
Most of the time, Python’s built-in sorted() and list.sort() are all you need. But if you ever try to sort a lot of data—millions to billions of values, big numeric logs, or giant SQL exports—you quickly run into a wall: RAM, speed, or both. So I built Quill-Sort (quill-sort on PyPI). dragonbreathIT / quill-sort quill-sort Adaptive Ultra-Sort — the fastest general-purpose sorting library for Python. from quill import quill_sort, quill_sorted quill_sort([3, 1, 4, 1, 5, 9]) # → [1, 1, 3, 4, 5, 9] quill_sort(records, key=lambda r: r['age']) # sort objects quill_sort(big_data, parallel=True) # use all CPU cores result = quill_sorted(iterable, reverse=True) # mirrors built-in sorted() Installation pip install quill-sort # core (no dependencies) pip install quill-sort[fast] # + numpy + psutil for max speed pip install quill-sort[all] # + numpy + pandas + psutil How it works Quill profiles your data at intake and routes to the optimal algorithm automatically: Data type Strategy Complexity Den
