Initial data commit

Task/Sorting-algorithms-Bogosort/Python/sorting-algorithms-bogosort-1.py

@@ -0,0 +1,16 @@
+import random
+
+def bogosort(l):
+    while not in_order(l):
+        random.shuffle(l)
+    return l
+
+def in_order(l):
+    if not l:
+        return True
+    last = l[0]
+    for x in l[1:]:
+        if x < last:
+            return False
+        last = x
+    return True

Task/Sorting-algorithms-Bogosort/Python/sorting-algorithms-bogosort-2.py

@@ -0,0 +1,2 @@
+def in_order(l):
+    return all( l[i] <= l[i+1] for i in xrange(0,len(l)-1))

Task/Sorting-algorithms-Bogosort/Python/sorting-algorithms-bogosort-3.py

@@ -0,0 +1,6 @@
+import random
+def bogosort(lst):
+   random.shuffle(lst)  # must shuffle it first or it's a bug if lst was pre-sorted! :)
+   while lst != sorted(lst):
+       random.shuffle(lst)
+   return lst

Task/Sorting-algorithms-Bogosort/Python/sorting-algorithms-bogosort-4.py

@@ -0,0 +1,12 @@
+import operator
+import random
+from itertools import dropwhile, imap, islice, izip, repeat, starmap
+
+def shuffled(x):
+    x = x[:]
+    random.shuffle(x)
+    return x
+
+bogosort = lambda l: next(dropwhile(
+    lambda l: not all(starmap(operator.le, izip(l, islice(l, 1, None)))),
+    imap(shuffled, repeat(l))))