Optimizing Worst Case Time complexity to O(1) for python dicts [closed]

Optimizing Worst Case Time complexity to O(1) for python dicts [closed]

References

Reference NO 1

http://stackoverflow.com/questions/15191918/optimizing-worst-case-time-complexity-to-o1-for-python-dicts

Reference NO 2

http://stackoverflow.com/questions/1963507/time-complexity-of-accessing-a-python-dict

Reference NO 3

http://www.python.org/doc/essays/list2str/

Reference NO 4

http://oreilly.com/python/excerpts/python-in-a-nutshell/testing-debugging.html

Reference NO 5

https://gist.github.com/2012250

Reference NO 6

http://esr.ibiblio.org/?p=4861

Reference NO 7

http://en.wikipedia.org/wiki/Skip_list

Reference NO 8

http://stupidpythonideas.blogspot.com/2013/07/sorted-collections-in-stdlib.html