Hey can anybody remind me of the following things which I have forgotten since I took Algorithm Analysis (about 10 years ago!) ...

(1) advantages/disadvantages of linked lists (for insertion and search)
(2) " " " of contiguous array
(3) " " " of associative array (i.e. map / hash)


I also need a brief reminder of how the following algorithms work, and their advantages/ disadvantages....thanks for any input!

quick sort
heap sort
insertion sort
merge sort
quick bucket sort
shell sort