Added Sorting Algorithm (Bogo Sort)

Sorting/Bogo Sort/in_Python.py

@@ -0,0 +1,28 @@
+"""
+Contributed by Deepanshu Arya <[email protected]>
+bogosort (also known as permutation sort, stupid sort, or slowsort) is a sorting algorithm 
+based on the generate and test paradigm. The function successively generates permutations 
+of its input  until it finds one that is sorted. It is not considered useful for sorting, 
+but may be used for educational purposes, to contrast it with more efficient algorithms.
+
+Time Complexity:
+Worst Case : O(∞) (since this algorithm has no upper bound)
+Average Case: O(n*n!)
+Best Case : O(n)(when array given is already sorted)
+Auxiliary Space: O(1)
+"""
+from random import shuffle
+
+def is_sorted(data) -> bool:
+    """Determine whether the data is sorted."""
+    return all(a <= b for a, b in zip(data, data[1:]))
+
+def bogosort(data) -> list:
+    """Shuffle data until sorted."""
+    while not is_sorted(data):
+        shuffle(data)
+    return data
+
+#driver code
+data = [int(x) for x in input().split()]
+print(bogosort(data))