Thanks, but it seems not a problem. if(i<j) after swap, the loop will execute another time, i++, j-- will be done at the begining. Also, I tried to make such changes, but the "online judge" won't accept that. If you want to test it. you can fill sticks[] with some data and write a main() function. The point is that I cannot find any case that will fail with the program. I am wondering if there is some special handling in qsort() of standard c library.
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
