Аdd bogo sort (#655)

Author: suhailmalik07

README.md

@@ -954,6 +954,7 @@ Read our [Contribution Guidelines](CONTRIBUTING.md) before you contribute.
 ##### Functions:
 
 1. [`Bubble`](./sort/bubblesort.go#L9):  Bubble is a simple generic definition of Bubble sort algorithm.
+1. [`Bogo`](./sort/bogosort.go#L32):  Bogo generates random permutations until it guesses the correct one.
 2. [`Bucket`](./sort/bucketsort.go#L7):  Bucket sorts a slice. It is mainly useful when input is uniformly distributed over a range.
 3. [`Comb`](./sort/combSort.go#L17):  Comb is a simple sorting algorithm which is an improvement of the bubble sorting algorithm.
 4. [`Count`](./sort/countingsort.go#L11): No description provided.

sort/bogosort.go

@@ -0,0 +1,38 @@
+// This is a pure Go implementation of the bogosort algorithm,
+// also known as permutation sort, stupid sort, slowsort, shotgun sort, or monkey sort.
+// Bogosort generates random permutations until it guesses the correct one.
+
+// More info on: https://en.wikipedia.org/wiki/Bogosort
+
+package sort
+
+import (
+	"math/rand"
+
+	"github.com/TheAlgorithms/Go/constraints"
+)
+
+func isSorted[T constraints.Number](arr []T) bool {
+	for i := 0; i < len(arr)-1; i++ {
+		if arr[i] > arr[i+1] {
+			return false
+		}
+	}
+
+	return true
+}
+
+func shuffle[T constraints.Number](arr []T) {
+	for i := range arr {
+		j := rand.Intn(i + 1)
+		arr[i], arr[j] = arr[j], arr[i]
+	}
+}
+
+func Bogo[T constraints.Number](arr []T) []T {
+	for !isSorted(arr) {
+		shuffle(arr)
+	}
+
+	return arr
+}

sort/sorts_test.go

@@ -85,6 +85,11 @@ func TestBubble(t *testing.T) {
 	testFramework(t, sort.Bubble[int])
 }
 
+func TestBogo(t *testing.T) {
+	t.Skip("Skipping test for Bogo Sort, as it uses a lot of resource.")
+	testFramework(t, sort.Bogo[int])
+}
+
 func TestBucketSort(t *testing.T) {
 	testFramework(t, sort.Bucket[int])
 }
@@ -230,6 +235,11 @@ func BenchmarkBubble(b *testing.B) {
 	benchmarkFramework(b, sort.Bubble[int])
 }
 
+func BenchmarkBogo(b *testing.B) {
+	b.Skip("Skipping benchmark for Bogo Sort, as it uses a lot of resource.")
+	benchmarkFramework(b, sort.Bogo[int])
+}
+
 func BenchmarkBucketSort(b *testing.B) {
 	benchmarkFramework(b, sort.Bucket[int])
 }