Lecture 7: Insertion Sort - Analysis of Complexity

The average-case time complexity of insertion sort is Θ(n2). The proof's outline: • Assuming all possible inputs are equally likely, evaluate the average number Ci ...

www.cs.auckland.ac.nz