Updated complementary exercises of sorting for CLRS 20110510

Added new complementary exercises for linear search.  I hope to move on in reading.  But I start to face one of the toughest program to write it right: binary search.

Insertion sort:
-C, perl, python (done)

-sentinel version of straight insertion sort (done)

-recursive version of insertion sort

-binary search

-binary insertion sort
-C++,java, lisp, ASM
-performance, worst case, average case
-different ways to avoid -INT_MAX as the sentinel. (state of art?)
-non-adaptive version of insertion sort.
-shell sort
-library sort
-tree sort(?)
-TAOCP Exercise in 5.2.1
-Sedgewick 6.3
-Sedgewick 6.3 Exercise

Selection sort:
-C, perl, python (done)
-C++,java, lisp, ASM
-stable version of selection sort.
-bidirectional version of selection sort.
-comparison with insertion sort.
-comparison with bubble sort
-recursive version of insertion sort
-cycle sort
-heap sort variants
     -tournament sort
     -smoothsort.
-TAOCP Exercise in 5.2.3
-Sedgewick 6.2
-Sedgewick 6.2 Exercise

Merge sort:
-C, perl(done)
-python, C++,java, lisp, ASM
-performance, worst case, average case 
-Improvements from Sedgewick.
-Non-recursive version or Bottom up version 
-in place mergesort.
-no extra memory implementation (state of art?)
-TAOCP Exercise in 5.4
-Sedgewick 8 (read - done)
-Sedgewick 8 Exercises.
-Shene's 5-9 Exercises. 

Linear search:

-TAOCP 6.1 and exercises.  Remember, it's not as trivial as you may think. 

Binary search:

-TAOCP 6.2 and exercies. 

-Chapter 4 and 5 of Programming Pearls.