Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Insertion Sort
Hello! This isn't really a Java question, but I created a Java program that does Insertion Sort, and my Java teacher wants me to find the average case for it. My teacher gave me a hint by saying that the answer is (1/4)(n^2) + (1/4)(n), but now he wants me to prove it. I'm not exactly sure how to do that; I even looked up various explanations online, but none have helped. So, is anyone willing to give me a clear, brief description of how that is the average case? Thanks in advance!
Related threads:
Re: Insertion Sort
Mmm, probability
It's been a while since I've analyzed insertion sort, but if I remember correctly the performance time of Insertion Sort is proportional to the number of inversions. The more inversions, the less efficient the algorithm becomes. Unfortunately, I can't remember the math behind this.
There's a better description of this here: 6.6 Performance Characteristics of Elementary Sorts
Re: Insertion Sort
That helped me a little bit, but unfortunately I still don't completely understand. Thanks anyway; I really appreciate it!
Reply With Quote