Merge pull request #108 from Ha1fByte/KotlinBogoSort

Kotlin bogo sort

Author: argonautica

Kotlin/BogoSort.kt

@@ -0,0 +1,47 @@
+import kotlin.random.Random
+
+fun main(args : Array<String>) {
+    //Create Array
+    var array = intArrayOf(4,5,3,9,1)
+
+    array = sort(array)
+
+    array.forEach {
+        println(it)
+    }
+}
+
+/**
+ * Use Bogo sort to randomly swap two inputs and then check if the list is sorted
+ */
+fun sort(input:IntArray):IntArray{
+
+    //keep repeating check until sorted
+    while (!isSorted(input)){
+        //get two randomly picked array locations
+        val index1 = Random.nextInt(0, input.size-1)
+        val index2 =  Random.nextInt(0, input.size-1)
+
+        //swap the values
+        val temp = input[index1]
+        input[index1] = input[index2]
+        input[index2] = temp
+    }
+    return input
+}
+
+/**
+ * Check if the array is sorted from lowest to highest
+ */
+fun isSorted(input:IntArray): Boolean{
+    var max:Int? = null
+    for(x in input.indices){
+        if(max == null || input[x] >= max){
+            max = input[x]
+        }else{
+            return false
+        }
+    }
+    return true
+}
+

README.md

@@ -13,7 +13,7 @@ _Sorting algorithms implemented in different languages (for hacktoberfest_ 😃_
 | Javascript | [`Bogo Sort`](Javascript/bogoSort.js) [`Counting Sort`](Javascript/countingSort.js) [`Heap Sort`](Javascript/HeapSort.js) [`Insertion Sort`](Javascript/Insertionsort.js) [`Merge Sort`](Javascript/MergeSort.js) <br> [`Quick Sort`](Javascript/Quicksort.js) [`Bubble Sort`](Javascript/bubbleSort.js) [`Shell Sort`](Javascript/shellSort.js ) [`Selection Sort`](Javascript/selectionSort.js) <br> [`Radix Sort`](Javascript/RadixSort.js) |
 | Python | [`Bogo Sort`](Python/BogoSort.py) [`Bubble Sort`](Python/BubbleSort.py) [`Bucket Sort`](Python/BucketSort.py) <br> [`Gnome Sort`](Python/GnomeSort.py) [`Insertion Sort`](Python/InsertionSort.py) [`Merge Sort`](Python/MergeSort.py) <br> [`Quick Sort`](Python/QuickSort.py) [`Radix Sort`](Python/RadixSort.py) [`Selection Sort`](Python/SelectionSort.py) <br> [`Binary Insertion Sort`](Python/BinaryInsertionSort.py)  [`Heap Sort`](Python/heapSort.py) |
 | Ruby | [`Bubble Sort`](Ruby/bubble_sort.rb) [`Gnome Sort`](Ruby/gnome_sort.rb)
-| Kotlin |[`Merge Sort`](Kotlin/MergeSort.kt) [`Bubble Sort`](Kotlin/BubbleSort.kt) [`Selection Sort`](Kotlin/selectionSort.kt) <br> [`Heap Sort`](Kotlin/HeapSort.kt) [`Insertion Sort`](Kotlin/InsertionSort.kt) [`Quick Sort`](Kotlin/QuickSort.kt)
+| Kotlin |[`Merge Sort`](Kotlin/MergeSort.kt) [`Bubble Sort`](Kotlin/BubbleSort.kt) [`Selection Sort`](Kotlin/selectionSort.kt) <br> [`Heap Sort`](Kotlin/HeapSort.kt) [`Insertion Sort`](Kotlin/InsertionSort.kt) [`Quick Sort`](Kotlin/QuickSort.kt) [`Bogo Sort`](Kotlin/BogoSort.kt)
 | Elixir | [`Selection Sort`](Elixir/selectionSort.exs)
 
 ## Contributing 🖇️