The example code is the divide and conquer bisection algorithm for symmetric tridiagonal matrices. You will notice that the high level divide and conquer code has been divided into several procedures which form a chain of continuations.