Can someone point me to a good resource that would show me for instance, how many comparisons a sort will make if:
The data is already ordered
The data is in reverse order
Something comparing the different sorting algorithms, or can the above be derived from the computational complexity of the sorts in question.
Why did you feel it necessary to re ask this question? If your previous question wasn't answered in the manner you wanted, perhaps you should have re specified the question.
Also, why not think about it and explain to us what you think the answers are.
Double post. Please continue your discussion where you started it: http://www.java-forums.org/new-java/...lgorithms.html.
In particular ask Junky if you don't understand his point that this is not a question about sorting. (I mean if the data were already sorted why would any comparisons be done?) Also you could ask if you are unsure of his use of the O() notation and its connection with your original question.
Agree with the above. Double posting and splitting discussion is unfair to the volunteers here and is bad even rude forum etiquette, especially when you posted this before replying to Junky.
Does anyone see a reason not to lock this thread?
partially because I've noticed that if the person helping me feels as though they have answered my originally question (and junky did a thorough job of answering the 1st question, as it was not very detailed), they do not post any more on that topic.