This this is the result on my machine if I change N to 1000
List: (seconds: 0, nanosecond: 296203084)
Table: (seconds: 0, nanosecond: 4101)
Run
- 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
