Chapter 12 quickSort confusion
 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
Last edited by scolty; May 15th, 2011 at 08:52 AM.