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

Project Activity

See All Activity >

Categories

Algorithms

License

MIT License

Follow Fast stable sorting in Delphi

Fast stable sorting in Delphi Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

Build gen AI apps with an all-in-one modern database: MongoDB Atlas

MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
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