can I do better that binary search

From: Abi (abi_kREMSPAM_at_myrealbox.com)
Date: 05/21/04

  • Next message: newstome_at_comcast.net: "Re: can I do better that binary search" 
    Date: 21 May 2004 15:41:38 +0530

    I have a ordered list of elements a1 < a2 < a3 .. < an
    given a key binary search for that is O(log n)
    can I make it better?
    abi

  • Next message: newstome_at_comcast.net: "Re: can I do better that binary search"