Introduction to algorithms-Chapter 1-2

Akamai ???????????????

Upper Bound (worst case analysis worst-case-analysis): commitment to users

Average case: T (n) is the weighted average of all input values, the expected time

Bast case (hypothetical): Some algorithms have shorter time for a specific input, but the average time and upper limit may be long.

Speed: Computer (express delivery, relative speed, absolute speed)

Progressive analysis: ignore computer-dependent things,

Focus on time-growth-Situation

Insert sort (N * n): n is small and fast,

Merge Sorting (n lg n): n is faster than or equal to 30

Recursive tree

My merge sort http://my.oschina.net/u/1384842/blog/307885

Introduction to algorithms-Chapter 1-2