The insertion sort corresponds to a natural, human approach to sorting. It's the way that you probably do it in real life.
For each item to be sorted, look through the list of items in order and insert it in sequence.
To understand the pseudocode, consider that the list can be divided into a sorted part (to the left) and an unsorted part (to the right)
for each item in list
Quicksort was invented in 1960 in Russia by Tony Hoare. It's a classic recursive algorithm.
Wikipedia has an excellent article on quicksort