Sedgewick's Algorithm in C Chapter 8

I just got a copy of Sedgewick's Algorithms (in C) and I certainly feel very excited about this.

The first thing I looked at is insertion sort.  It covers sentinel in insertion sort and it gives pretty good discussion on its pros and cons.  I love it.

Then I looked at merge sort,  I feel very blurry about the details of it.  Merge sort is not covered deeply in CLRS.  So there are things I don't fully grasp.

Sedgewick's Algorithm is well known to be deep in sorting but tends to have bugs in its C program.  It will probably take me some time to fully digest it.