Adopt the recursion-unrolling

Adopt the recursion-unrolling approach to derive more efficient algorithms to compute the inverse of the Hilbert mapping, i.e., the Hilbert index. In particular, derive an algorithm that corresponds to Function hilbertBially. 4.8. Derive the operators for a Hilbert mapping that maps the unit interval to the square Œ1; 1 Œ1; 1 (instead of Œ0; 12). Try to turn this mapping into a finitestate-machine representation, as suggested in Sect. 4.6.2.