The Most Efficient Algorithm to Find First Prefix-Match From a Sorted String Array?

Question

Input:

1) A huge sorted array of string SA;

2) A prefix string P;

Output:

The index of the first string matching the input prefix if any. If ther

Answer 1

The FreeBSD kernel use a Radix tree for its routing table, you should check that.