1.1-1
Sorting: rank the student's according to the score
Determining the best order for multiplying matrices: When doing probability calculation, one may require lots of matrices multiplication for the cumulative probability results
Finding the convex hull:
1.1-2
Space
1.1-3
Linked list:
Strength: can be used for chaining
Weakness: O(n) time for random access
1.1-4:
Similarity: both about gaining the best solution
Difference: APSP (all pair shortest path) only involves in one parameter -- the cost; while TSP (travelling salesman) is about gaining the maximum profit under limited resource
1.1-5:
Only Best Solution Will Do: find the k-th solution from an n- element table; look-up time should be 1.
Approximately the best can do: find a good route to travel all over the world
1.2-1:
Application: music player -- random play (Function of the Algorithm involved)
Require random algorithm to randomize an array of numbers
1.2-2:
1.2-3:
