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
MongoDB Atlas runs apps anywhere
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Fast stable sorting in Delphi!