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
Get the most trusted enterprise browser
Defend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Fast stable sorting in Delphi!