Thomas.Chang wrote: > Thanks for you reply. > Yes, I can use the qsort() in standard c library to finish my work. But > what I want to know is why I was wrong. Qsort is a great, because it > shortens the sorting time from O(n^2) to O(nlogn). But I want to know > if I am thinking the wrong way against the discoverer's. > The "i++" "j--" expressions are just to skip the sticks[left] and find > the right position for it, so I don't think that's a weak point. > Also, all cases have passed under my program. Everything proves ok > logically and practically. That's what is anonying me.
snip.. well, i would suggest you to put the query on comp.lang.c as its specifc to C. -N --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
