• Home
 · 
• VB function enhancement
 · 
• Super Fast String Sorts Update(30/03/2007)

Super Fast String Sorts Update(30/03/2007)

by Tai Chi Minh Ralph Eastwood (1 Submission)
Category: VB function enhancement
Difficulty: Intermediate
Date Added: Wed 3^rd February 2021
Rating: (19 Votes)

I have implemented two of the algorithms 'popular' MSD Radix Sorts
based on the implementations done by Peter M. McIlroy and Keith Bostic in
their paper Engineering Radix Sort. Of the techniques used were VBSpeed techniques
such as safearray 'hacking' and others.
These algorithms go extremely fast, about 10x faster than a standard iterative version of
a QuickSort algorithm. This is shown the the accompanying benchmark...
Please compile to native with all advanced options checked to get best results, but I think it performs pretty well in IDE as well.
Updated with TriQuickSort instead of QuickSort.
Updated with TriQuickSort fixed+2x faster
Updated with TriQuickSort Non-Recursive, rd's strSwapTable, Export to CSV
Updated with some GUI changes and Ulli's algos

Inputs
Unsorted String Arrays
Code Returns
Sorted String Arrays

Download Super Fast String Sorts Update(30/03/2007)

Download Super Fast String Sorts Update(30/03/2007) (2 MB)

Super Fast String Sorts Update(30/03/2007) Comments

No comments have been posted about Super Fast String Sorts Update(30/03/2007). Why not be the first to post a comment about Super Fast String Sorts Update(30/03/2007).

Post your comment