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

Project Samples

Testsuite for sorting

Project Activity

See All Activity >

Categories

Algorithms

License

MIT License

Follow Fast stable sorting in Delphi

Fast stable sorting in Delphi Web Site

nel_h2
Keep company data safe with Chrome Enterprise Icon
Keep company data safe with Chrome Enterprise

Protect your business with AI policies and data loss prevention in the browser

Make AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
Download Chrome
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Fast stable sorting in Delphi!

Additional Project Details

Operating Systems

Windows

Registered

2021-01-24
Report inappropriate content