Re:Aguri: Coolest Data Structure You've Never Heard Of
by aston on Monday January 21, 2008 @11:31PM
(#102016)
There aren't any algorithms to find things in an unsorted array in less than worst case linear time. I think you're confusing search (for some value) with select (a value with a given index in the sorted array).
[ Parent
| on HN ]
Re:Aguri: Coolest Data Structure You've Never Heard Of
by eru on Wednesday January 23, 2008 @10:15AM
(#102812)
If you want to do several searches on the same data - that is initially unsorted - you can get better than O(n) per query. But like you said - not for the first one.
Re:Aguri: Coolest Data Structure You've Never Heard Of
by Xichekolas on Tuesday January 22, 2008 @06:30AM
(#102144)
Yeah, yeah I was... was just thinking about that over breakfast.