1. package shitty.bogo;
  2. import java.util.*;
  4. public class sorter {
  6. public static void main(String[] args) {
  7. long count = 0;
  8. System.out.println("How many elements would you like to sort?");
  9. Scanner in = new Scanner(System.in);
  10. int elnum = in.nextInt();
  11. int[] elements = new int[elnum];
  12. for(int c = 0; c < elements.length; c++)
  13. elements[c] = c;
  14. do{
  15. shuffleArray(elements);
  16. System.out.print(count + ": ");
  17. for (int c = 0; c < elements.length; c++)
  18. System.out.print(elements[c] + " ");
  19. System.out.println("");
  20. count++;
  21. } while(isSorted(elements) == false);
  22. System.out.println( "List is sorted above in " + count + " tries!");
  23. main(args);
  24. in.close();
  26. }
  27. public static void shuffleArray(int[] ar){
  28. Random rnd = new Random();
  29. for (int i = ar.length - 1; i > 0; i--){
  30. int index = rnd.nextInt(i + 1);
  31. int a = ar[index];
  32. ar[index] = ar[i];
  33. ar[i] = a;
  34. }
  35. }
  36. public static boolean isSorted(int[] e){
  37. for(int c = 0; c < e.length -1; c++){
  38. if(e[c] > e[c+1])
  39. return false;
  40. }
  41. return true;
  42. }
  44. }

So, I made this out of inspiration for some of the students in a lower level CS class. They were talking about sorting algorithms and wanted to know one that could work in the best possible time. Introduce bogo sort! While it relies on this nasty thing called probability and its Worse case is O(forever), it 'could' solve it on the first try. Enjoy.

If you want it to go faster, comment out the print statements in the while loop.

Example of output, number entered being ten.

5616773: 2 1 4 5 6 3 7 8 9 0

5616774: 9 5 6 2 4 1 3 8 0 7

5616775: 8 2 5 1 9 3 7 4 6 0

5616776: 6 7 0 2 1 5 3 4 8 9

5616777: 3 1 5 8 6 4 9 0 7 2

5616778: 5 6 7 8 2 1 3 4 0 9

5616779: 0 1 2 3 4 5 6 7 8 9

List is sorted above in 5616780 tries!