Significant gains in processing times when sorting arrays with structure in the data. Pre-sorted arrays with relatively few modifications may be sorted 20-30 times faster than Delphi's default QuickSort.
The project includes a test suite.
Features
- Stable sorting of arrays
- Adaptable to any data type
- Attractive for real-world data
- Suitable for large arrays (up to 25M)
- Fast
Categories
AlgorithmsLicense
MIT LicenseFollow Fast stable sorting in Delphi
Other Useful Business Software
Your top-rated shield against malware and online scams | Avast Free Antivirus
Our antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Fast stable sorting in Delphi!