abranhe · abranhe · Feb 22, 2019 · Feb 19, 2019 · Feb 20, 2019 · Feb 20, 2019
diff --git a/package.json b/package.json
@@ -11,8 +11,8 @@
     "url": "git+https://github.com/abranhe/allalgorithms-js.git"
   },
   "files": [
-	  "index.js",
-	  "src/"
+    "index.js",
+    "src/"
   ],
   "keywords": [
     "computer-science",

diff --git a/src/sorting.js b/src/sorting.js
@@ -1,4 +1,5 @@
 module.exports = {
 	bubbleSort: require('./sorting/bubble-sort'),
-	mergeSort: require('./sorting/merge-sort')
+	mergeSort: require('./sorting/merge-sort'),
+	bogoSort: require('./sorting/bogo-sort')
 };
diff --git a/src/sorting/bogo-sort.js b/src/sorting/bogo-sort.js
@@ -0,0 +1,42 @@
+const Comparator = require('../util/comparator');
+
+/* HELPER-FUNCTION
+   IsSort : checks whether the given array is sorted (ascending)
+   Returns true if the given array is ascending sorted otherwise false
+*/
+const isSorted = (a, comparator) => {
+	for (let i = 0; i < a.size - 1; i++) {
+		if (comparator.greaterThan(a[i], a[i + 1])) {
+			return false;
+		}
+	}
+	return true;
+};
+
+/*
+    HELPER-FUNCTION
+    RandInt : returns a random integer between 0 and N-1
+*/
+const randInt = N => {
+	return Math.floor(Math.random() * N);
+};
+
+/*
+    BogoSort: bogo-sort (stupid-sort) algorithm for a given array 'a'
+*/
+const bogoSort = (arr, compareFunction) => {
+	const comparator = new Comparator(compareFunction);
+
+	while (!isSorted(arr, comparator)) {
+		const a = randInt(arr.size);
+		const b = randInt(arr.size);
+
+		const tmp = arr[a];
+		arr[a] = arr[b];
+		arr[b] = tmp;
+	}
+	return arr;
+};
+
+module.exports = bogoSort;
+
diff --git a/src/test/sorting.test.js b/src/test/sorting.test.js
@@ -12,3 +12,8 @@ test('Testing Bubble Sort', t => {
 test('Testing Merge Sort', t => {
 	t.deepEqual(expected, sorting.mergeSort(array));
 });
+
+test('Testing Bogo Sort', t => {
+	t.deepEqual(expected, sorting.bogoSort(array));
+});
+