make the page less wide by chaning up the mkl url to the docs on matrix formats
adding basic naive hybrid search. The idea of the hybrid search is that the correct value will typically be right
by the starting position, so that a < O(log n) linear scan (in this case I just check the first 97 slots rather than compute the integer log) will probably find
the correct value after a constant number of reads, and thus does O(1) work in the average case.
However, a linear scan would have a bad, \Theta(n) worse case,
so Hybrid search falls back to an offset binary search to provide an O(log n) worst case, along with the O(1) average case.