Re: Why Seq search is faster than Table search

[spip]

Please note also that the code version in the 
[playground](https://play.nim-lang.org/#ix=2r1w) tests only on the `0` element 
of `seq` and `Table`.
    
    
    ...
    for _ in 0 ..< 1_000_000:
        discard myList.contains(0)
    echo("List: ", getMonoTime() - start)
    
    start = getMonoTime()
    for _ in 0 ..< 1_000_000:
        discard myTable.hasKey(0)
    ...
    
    
    Run

Also, the `MyTable` and `MyList` don't contain the same elements as you used 
`countdown(1_000_000, 0)` to fill the `seq` but excluded `1_000_000` when doing 
the tests.