From 8017c44e9f91a1ac4c8db5fd584cbafef5f59cfb Mon Sep 17 00:00:00 2001
From: Ammar <32436267+ammar0211@users.noreply.github.com>
Date: Tue, 8 Oct 2019 04:26:41 +0530
Subject: [PATCH] Created Readme for BozoSort

---
 sort/BozoSort/README.md | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 sort/BozoSort/README.md

diff --git a/sort/BozoSort/README.md b/sort/BozoSort/README.md
new file mode 100644
index 0000000000..971f1f149f
--- /dev/null
+++ b/sort/BozoSort/README.md
@@ -0,0 +1,24 @@
+# Bozo Sort
+
+The idea is very simple: take the list, check if it's sorted, and of it's not, swap two random elements of the list. Proceed like that until the list becomes sorted.
+
+> ## Pseudocode
+PseudoCode to bozosort an array - 
+    
+    To bozo sort an array:
+ 
+	    While the array is unsorted,
+    
+		    Swap two randomly selected entries.
+       
+	     end
+    
+    end
+  
+ > ## Complexity
+ 
+ In the very worst case, Bozosort runs forever -- we could get really unlucky, and keep swapping elements 0 and 1 forever, for example.
+
+We can talk instead about how long Bozosort will take on average. The analysis is not actually easy, but roughly speaking, we can hope that we'll go through every permutation of the list once, on average (we'll come back to some permutations many times, and we will sort the list before getting to some other permutations). There are n! permutations of a list of length n in total, so we can estimate that on average, Bozosort takes O(n!) time.
+
+(Note that actually, is_sorted_nondecreasing() takes O(n) time every time, so saying the runtime is O(n×n!)≈O((n+1)!) is more correct, but it doesn't really make a difference since n! is so large.)