Mintoris Forum

Author Topic: Sorting Algorithm Comparison  (Read 1995 times)


  • Global Moderator
  • Hero Member
  • *****
  • Posts: 1899
Sorting Algorithm Comparison
« on: Sep 17, 2014, 11:29 PM »
For most uses the built in sort function is lightning fast, but there are some specialized sorting applications which require a custom sorting algorithm. Below is attached a code snippet which tests several different sorting algorithms which you can modify to suit your needs.

« Last Edit: Sep 18, 2014, 07:17 PM by Chuck »


  • Sr. Member
  • ****
  • Posts: 146
Re: Sorting Algorithm Comparison
« Reply #1 on: Oct 08, 2014, 08:28 AM »
I have added a version which includes the popular quicksort algorithm invented by Tony Hoare in 1960.  This sort is O(n log n), which is the same as merge sort, but usually a bit faster.