Initial data commit

Task/Sorting-algorithms-Bogosort/Java/sorting-algorithms-bogosort-1.java

@@ -0,0 +1,54 @@
+public class BogoSort
+{
+	public static void main(String[] args)
+	{
+		//Enter array to be sorted here
+		int[] arr={4,5,6,0,7,8,9,1,2,3};
+		
+		BogoSort now=new BogoSort();
+		System.out.print("Unsorted: ");
+		now.display1D(arr);
+		
+		now.bogo(arr);
+		
+		System.out.print("Sorted: ");
+		now.display1D(arr);
+	}
+	void bogo(int[] arr)
+	{
+		//Keep a track of the number of shuffles
+		int shuffle=1;
+		for(;!isSorted(arr);shuffle++)
+			shuffle(arr);
+		//Boast
+		System.out.println("This took "+shuffle+" shuffles.");
+	}
+	void shuffle(int[] arr)
+	{
+		//Standard Fisher-Yates shuffle algorithm
+		int i=arr.length-1;
+		while(i>0)
+			swap(arr,i--,(int)(Math.random()*i));
+	}
+	void swap(int[] arr,int i,int j)
+	{
+		int temp=arr[i];
+		arr[i]=arr[j];
+		arr[j]=temp;
+	}
+	boolean isSorted(int[] arr)
+	{
+
+		for(int i=1;i<arr.length;i++)
+			if(arr[i]<arr[i-1])
+				return false;
+		return true;
+	}
+	void display1D(int[] arr)
+	{
+		for(int i=0;i<arr.length;i++)
+			System.out.print(arr[i]+" ");
+		System.out.println();
+	}
+
+}

Task/Sorting-algorithms-Bogosort/Java/sorting-algorithms-bogosort-2.java

@@ -0,0 +1,24 @@
+import java.util.Collections;
+import java.util.List;
+import java.util.Iterator;
+
+public class Bogosort {
+    private static <T extends Comparable<? super T>> boolean isSorted(List<T> list) {
+        if (list.isEmpty())
+            return true;
+        Iterator<T> it = list.iterator();
+        T last = it.next();
+        while (it.hasNext()) {
+            T current = it.next();
+            if (last.compareTo(current) > 0)
+                return false;
+            last = current;
+        }
+        return true;
+    }
+
+    public static <T extends Comparable<? super T>> void bogoSort(List<T> list) {
+        while (!isSorted(list))
+            Collections.shuffle(list);
+    }
+}