Update README.md

mitghi · web-flow · commit 28df4f3ab785 · 2016-08-21T19:25:31.000+02:00
diff --git a/Skip-List/README.md b/Skip-List/README.md
@@ -1 +1,3 @@
+# Skip List
 
+> Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space.  -**[William Pugh](https://en.wikipedia.org/wiki/William_Pugh)**

Original file line number	Diff line number	Diff line change
`@@ -1 +1,3 @@`
	`1`	`+# Skip List`
`1`	`2`
	`3`	`+> Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space. -[William Pugh](https://en.wikipedia.org/wiki/William_Pugh)`