Re: can I do better that binary search
From: Abi (abi_kREMSPAM_at_myrealbox.com)
Date: 05/27/04
- Next message: sk prasad: "Randomized MIS in Scheduling"
- Previous message: Stefan Melis: "Fadela"
- In reply to: Richard Harter: "Re: can I do better that binary search"
- Next in thread: Richard Harter: "Re: can I do better that binary search"
- Reply: Richard Harter: "Re: can I do better that binary search"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 27 May 2004 18:40:55 +0530
Could you be more specific. I didn't get much of it though what I'm
looking for is something similar, I'm donot want to reduce total
computational cost but only the number of comparisons and the elements
are put into the array in sorted order one by one.
abi
- Next message: sk prasad: "Randomized MIS in Scheduling"
- Previous message: Stefan Melis: "Fadela"
- In reply to: Richard Harter: "Re: can I do better that binary search"
- Next in thread: Richard Harter: "Re: can I do better that binary search"
- Reply: Richard Harter: "Re: can I do better that binary search"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]