The list one should O(N^2) and here N = 10^6. Unless you have a very very special CPU, it can't complete in 9384ns...
- Why Seq search is faster than Table search cyberlis
- Re: Why Seq search is faster than Table search Yardanico
- Re: Why Seq search is faster than Table search cyberlis
- Re: Why Seq search is faster than Table search jasonfi
- Re: Why Seq search is faster than Table searc... miran
- Re: Why Seq search is faster than Table ... cyberlis
- Re: Why Seq search is faster than Ta... cyberlis
- Re: Why Seq search is faster tha... Yardanico
- Re: Why Seq search is faster tha... cyberlis
- Re: Why Seq search is faster tha... jackhftang
- Re: Why Seq search is faster tha... jackhftang
- Re: Why Seq search is faster tha... Yardanico
- Re: Why Seq search is faster tha... spip
- Re: Why Seq search is faster tha... lscrd
- Re: Why Seq search is faster tha... jasonfi
- Re: Why Seq search is faster tha... treeform
- Re: Why Seq search is faster tha... treeform
- Re: Why Seq search is faster tha... lscrd
- Re: Why Seq search is faster tha... erikenglund
- Re: Why Seq search is faster tha... snej
