Add benchmarks/performance notes

[alexkreidler]

I'd love to see some benchmarks to compare this to using a regular map or just using a slice containing a Key and Value.

I'd also love a little section in the README describing the big-O computational complexity of each operation.

This would really differentiate this little library from the others.

Thanks!