diff --git a/bogoSort.cpp b/bogoSort.cpp
new file mode 100644
index 0000000..2f3a6c7
--- /dev/null
+++ b/bogoSort.cpp
@@ -0,0 +1,38 @@
+// implementation of Bogo Sort
+#include <bits/stdc++.h>
+
+using namespace std;
+
+bool isSorted(int a[], int n){
+	while (--n > 1)
+		if (a[n] < a[n - 1])
+			return false;
+	return true;
+}
+
+void shuffle(int a[], int n){
+	for (int i = 0; i < n; i++)
+		swap(a[i], a[rand() % n]);
+}
+
+void bogosort(int a[], int n){
+	while (!isSorted(a, n))
+		shuffle(a, n);
+}
+
+
+void printArray(int a[], int n){
+	for (int i = 0; i < n; i++)
+		printf("%d ", a[i]);
+	printf("\n");
+}
+
+
+int main(){
+	int a[] = { 3, 2, 5, 1, 0, 4 };
+	int n = sizeof a / sizeof a[0];
+	bogosort(a, n);
+	printf("Sorted array :\n");
+	printArray(a, n);
+	return 0;
+}