gnome sort added

sawhney · sawhney · commit 664a758ed5ee · 2014-07-16T12:58:48.000+05:30
diff --git a/algorithms/sorting/gnome_sort.py b/algorithms/sorting/gnome_sort.py
@@ -0,0 +1,33 @@
+"""
+    gnome_sort.py
+
+    Implementation of gnome sort on a list and returns a sorted list.
+
+    Gnome Sort Overview:
+    ---------------------
+    A sorting algorithm similar to insertion sort except that the element is moved to its proper place by a series of swaps.
+
+    Time Complexity: O(n^2)
+
+    Space Complexity: O(1) auxillary
+
+    Stable: No
+
+    Psuedo code: http://en.wikipedia.org/wiki/Gnome_sort
+
+"""
+
+
+def sort(seq):
+
+    i = 1
+    while i < len(seq):
+        if seq[i] < seq[i-1]:
+            seq[i], seq[i-1] = seq[i-1], seq[i]
+            if i > 1:
+                i -= 1
+        else:
+            i += 1
+    return seq
+
+print sort([11, 14, 11, -1, 24, -12343, -0.34, 123.22, 12, 14, 23,33])
