Good morning,
[edit] ive been stepping through the quickSort code and although i dont find it intuitive (seems to be a little over my head) i was wondering whether the following would have been considerably slower?

1) find minimum value in array and swap with element 0 in array.
2)re-scan array from element 1->array.Length and swap element 1 for the smallest element found.
3)repeat step 2 for remaining array elements, ie 2 onwards.

Thanks for your time

The method you're describing is close to a simple Bubble Sort. There are any number of sorting algorithms and the Bubble Sort is about the easiest to understand. However, in most cases, it is also the slowest. (If the list is already in sorted order and you insert 1 new value, the Bubble Sort can be the fastest sort.) If you want to understand how qsort (or almost any other sort works), you can Google it and find a number of explanations with samples (http://www.inf.fhflensburg.de/lang/a...ck/quicken.htm)

__________________
Jack Purdum, Ph.D.
Author: Beginning C# 3.0: Introduction to Object Oriented Programming (and 14 other programming texts)

Evening, thanks for taking the time to reply. I initially had some issues getting my head around the quicksort code and although i roughly understand how it works, its still doesnt feel intuitive. Thanks for the link though + hopefully that will allow me to get a decent nights sleep tonight.