"QuickSort is an in-memory recursive sort"
QuickSort is a version of Tony Hoare's classic QuickSort function ported over to Java for people who enjoy using the Java language directly or via a Windows desktop shortcut to the computer code which loads it right into Java itself to execute it. The QuickSort approach uses a unique pivot point which ensures that all elements below the pivot are smaller than the ones that sit above the pivot. Then the function repeatedly splits the lower and upper halves in order to recursively sort through items over and over until complete. As a result this sort function is much slower than other approaches. Sorting is actioned by comparing two items to aid in the sorting action.
QuickSort Key Features:
- Alternative sorting approach that takes a pivot point with upper half being larger and below the pivot being smaller
- The sort them recursively runs through the lists to reorganize them until everything is complete
- Much slower sorting process than other ones
- Requires Java 1.7 or later
- Requires Windows
QuickSort is a sorting program that takes a slow, more methodical approach to sorting.
Requirements: Java 1.7+
What's new in this version: bundle with pad and ant scripts
OSJava, Linux, Mac OS, Unix, Windows
DeveloperCanadian Mind Products
Updated11 Jan 2017
Downloads1,953 (1 last week)
Top user review