Limbic~Region has asked for the wisdom of the Perl Monks concerning the following question:

Lazy web,
I am looking for help constructing a modified binary search.

I have a large array of strings which contain duplicates sorted in ASCIIbetical order. Given two strings ($beg & $end), I want to find the number of elements in the array that are between the two points. My idea was to first perform a binary search to find the index of the nearest element to $beg and then $end and do some math.

Here are the two things that lead me to ask you dear lazy web.

Cheers - L~R