Hirschberg, D.S.2007-10-312007-10-311978-07-202003-10-23D. Hirschberg, "A Lower Worst-Case Complexity for Searching a Dictionary," <i>Rice University ECE Technical Report,</i> no. 7808, 1978.https://hdl.handle.net/1911/19955Tech ReportIt is shown that k(p+3)/2 + p-2 letter comparisons suffice to determine whether a word is a member of a lexicographically ordered dictionary containing 2^p-1 words of length k. This offers a potential savings (compared to worst case complexity of binary search) that asymptotically approaches 50 percent.engsearchingReportsearching