You are currently viewing the BOOK: Beginning C# 3.0 : An Introduction to Object Oriented Programming ISBN: 978-0-470-26129-3 section of the Wrox Programmer to Programmer discussions. This is a community of tens of thousands of software programmers and website developers including Wrox book authors and readers. As a guest, you can read any forum posting. By joining today you can post your own programming questions, respond to other developers’ questions, and eliminate the ads that are displayed to guests. Registration is fast, simple and absolutely free .
In listing 12-4, method getPivotPoint does a call to
Code:
doSort(first, end-1)
I feel this call isn't needed at all. If I remove it from the code, the sorting still works.
Also, listing 12-4 contains 3 calls to doSort while the non generic version in listing 12-2 only contains two calls. I think that in listing 12-4, the two recursive calls inside method doSort itself are all you need.
You're right...it does work fine on both even and odd numbers of items without the call to doSort(). Quite honestly, I've slept since I wrote this code and have no idea why I put it in there!
__________________
Jack Purdum, Ph.D.
Author: Beginning C# 3.0: Introduction to Object Oriented Programming (and 14 other programming texts)
The Following User Says Thank You to DrPurdum For This Useful Post:
Ch 12 QuickSort too much calls to doSort()?
Linear Mode
