ita; rename to clrs

This is the proper name for the book!
clrs; exercise 6.1.1 - min/max elements in a heap with height h
clrs; exercise 6.1.2 - n-el heap height is ⎣lgn⎦
clrs; exercise 6.1.3 - obvious heap properties
clrs; exercise 6.1.4 - smallest element in max-heap
clrs; exercise 6.1.5 - is a sorted array a min-heap?
clrs; exercise 6.1.6 - a non-heap
clrs; exercise 6.1.7 - indices of leaves in a heap
clrs; exercise 6.1.2 - illustrate MAX-HEAPIFY
clrs; exercise 6.2.2 - MIN-HEAPIFY
clrs; exercise 6.2.3 - effect of MAX-HEAPIFY when i is largest
clrs; exercise 6.2.4 - effect of MAX-HEAPIFY on leaves
clrs; exercise 6.2.5 - max_heapify w/o recursion
clrs; exercise 6.2.6 - MAX-HEAPIFY worst-case is Ω(lgn)
clrs; exercise 6.3.1 - visualize build-max-heap
clrs; exercise 6.3.2 - why A.length/2 → 1?
clrs; exercise 6.3.3 - max № nodes / height h
clrs; add a config.ru