From d3dbd65547bc351c2ad1d62d1973b1e4c5e9f715 Mon Sep 17 00:00:00 2001
From: Estevan Pequeno <estevan.pequeno@gmail.com>
Date: Fri, 30 Dec 2011 11:38:13 -0600
Subject: [PATCH] Update docs/writing/style.rst

---
 docs/writing/style.rst | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/docs/writing/style.rst b/docs/writing/style.rst
index e0cf87d..54b4a10 100644
--- a/docs/writing/style.rst
+++ b/docs/writing/style.rst
@@ -14,6 +14,23 @@ A common idiom for creating strings is to use `join <http://docs.python.org/libr
 
 This will set the value of the variable *word* to 'spam'. This idiom can be applied to lists and tuples.
 
+Sometimes we need to search through a collection of things. Let's look at two options: lists and dictionaries.
+
+Take the following code for example::
+    
+    d = {'s': [], 'p': [], 'a': [], 'm': []}
+    l = ['s', 'p', 'a', 'm']
+    
+    def lookup_dict(d):
+        return 's' in d
+
+    def lookup_list(l):
+        return 's' in l
+
+Even though both functions look identical, because *lookup_dict* is utilizing the fact that dictionaries in python are hashtables, the lookup performance between the two is very different.
+Python will have to go through each item in the list to find a matching case, which is time consuming. By analysing the hash of the dictionary finding keys in the dict can be done very quickly.
+For more information see this `StackOverflow <http://stackoverflow.com/questions/513882/python-list-vs-dict-for-look-up-table>`_ page.
+
 Zen of Python
 -------------