DownloadSignificant 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
Project Samples
Categories
AlgorithmsLicense
MIT LicenseFollow Fast stable sorting in Delphi
You Might Also Like
Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Fast stable sorting in Delphi!