Members

Technology Zones

IBM Learning Center

Articles

Hosted By

MaximumASP

Info

Rated
Read 46,975 times

Downloads

Related Categories

Sorting Algorithms

Apoc

This sample code is a VB6 Project that will show you exactly what a sort looks like. The Quicksort algorithm is included along with the Selection Sort. Both of these sorts are extremely fast, but they can be compared in this program easily. In addition to the Quicksort, a Quicksort for sorting 2-dimensional arrays is included. It works just like the quicksort, only you can sort an array according to one of the dimensions, and the other dimension will sort along with it, so nothing is scrambled. An Array of Progress Bars is also included, so that the Bubble Sort could be seen, and an option for slowing down the Quicksort and Selection Sort is included so you can see both of these on the ProgressBar Array. I hope this basic sample code will help some of you looking for way to sort things out. Good luck.

Current Occupation: consultant; Degrees: BS-Computer Science, BS-Mathematics, Japanese minor; Known Languages: C#, ASP.NET, WPF, PHP, SQL, C++, VB

Comments

  • Re: [2402] Sorting Algorithms

    Posted by Infused on 22 Aug 2008

    yes. the dimension you provided to sort was based on base 1 not base 0. the correct array dimension to sort by is 0 not 1 and then it works.


    also, your array...

  • Re: [2402] Sorting Algorithms

    Posted by FreeHansje on 14 Sep 2007

    You know, I thought this is very nice. I've tried to get the 2-dim sort working, but I can't. It seems the Quicksort33 algoritm does something nasty with the last 2 parameters,the Lbound and Ubound...

  • Has someone a Sample for the QuickSort33 ?

    Posted by BabyHerman on 27 Oct 2005

    Thanks for this cool sorting algorithm !

    If someone got a sample for the QuickSort33 too it wood be great.
    If not i will try it on my own ..

    Thanks JS

  • QuickSort

    Posted by Carlo Lopes on 27 Nov 2002

    Good, very good.
    this program show me how Qsort works

    Thanks