For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text).  Some choices may be used multiple times or not at all. Dictionary(map) ADT: Quicksort: Mergesort: Radix sort over big integer numbers: Insertion sort: Selection sort: Heapsort: Counting sort over a small range of integers: Bucket sort: Bubble sort: Depth-First-Search: Bellman-Ford’s algorithm: Prim’s algorithm: Dijkstra’s algorithm: 0-1 knapsack problem: Hints : sorting: continuously swapping elements while finding the next number to add in the sorted sublist sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there sorting: in general, sorting the least significant position first sorting: finding  the smallest element in the unsorted sublist sorting: partition into two sub-arrays around a pivot value then making recursive calls sorting: recursively dividing into two sub-arrays first then merge them to produce new sorted sublists sorting: parallel processing for all the input data sorting: its efficiency is heavily depending on the uniform distribution of input data sorting: non-comparison algorithm utilizing integer characteristics by counting the number of objects that have each distinct key value sorting: branch and bound among input data elements completely connected graph handling negative edge cost in finding the single-source shortest path finding values by key, not by positional information such as index a non-deterministic polynomial (NP) problem finding shortest paths from a source to all other nodes on the graph producing a shortest-path tree a dynamic programming solution a greedy choice solution tree of n-1 edges (n: number of vertices) use a queue to traverse an entire graph use a stack to traverse an entire graph

For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text).  Some choices may be used multiple times or not at all.

Hints :

1. sorting: continuously swapping elements while finding the next number to add in the sorted sublist
2. sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key
3. sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there
4. sorting: in general, sorting the least significant position first
5. sorting: finding  the smallest element in the unsorted sublist
6. sorting: partition into two sub-arrays around a pivot value then making recursive calls
7. sorting: recursively dividing into two sub-arrays first then merge them to produce new sorted sublists
8. sorting: parallel processing for all the input data
9. sorting: its efficiency is heavily depending on the uniform distribution of input data
10. sorting: non-comparison algorithm utilizing integer characteristics by counting the number of objects that have each distinct key value
11. sorting: branch and bound among input data elements
12. completely connected graph
13. handling negative edge cost in finding the single-source shortest path
14. finding values by key, not by positional information such as index
15. a non-deterministic polynomial (NP) problem
16. finding shortest paths from a source to all other nodes on the graph producing a shortest-path tree
17. a dynamic programming solution
18. a greedy choice solution
19. tree of n-1 edges (n: number of vertices)
20. use a queue to traverse an entire graph
21. use a stack to traverse an entire graph