I can understand insertion sort algorithm needs n times once for each item to insert. But for the worst case, how did I get another n in "n * n" operation? What it mean for the worst case? Thanks for ...