GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Sorts/BogoSort.java at master · feinoah/Java Expand file tree/ Copy pathBogoSort.javaMore file actions 57 lines (43 loc) · 1.34 KB / Copy pathBogoSort.javaFile metadata and controls57 lines (43 loc) · 1.34 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 package Sorts; import java.util.Random; /** * * @author Podshivalov Nikita (https://github.com/nikitap492) * * @see SortAlgorithm * */ public class BogoSort implements SortAlgorithm { private static final Random random = new Random(); private static <T extends Comparable<T>> boolean isSorted(T array[]){ for(int i = 0; i<array.length - 1; i++){ if(SortUtils.less(array[i + 1], array[i])) return false; } return true; } // Randomly shuffles the array private static <T> void nextPermutation(T array[]){ int length = array.length; for (int i = 0; i < array.length; i++) { int randomIndex = i + random.nextInt(length - i); SortUtils.swap(array, randomIndex, i); } } public <T extends Comparable<T>> T[] sort(T array[]) { while(!isSorted(array)){ nextPermutation(array); } return array; } // Driver Program public static void main(String[] args) { // Integer Input Integer[] integers = {4, 23, 6, 78, 1, 54, 231, 9, 12}; BogoSort bogoSort = new BogoSort(); // print a sorted array SortUtils.print(bogoSort.sort(integers)); // String Input String[] strings = {"c", "a", "e", "b","d"}; SortUtils.print(bogoSort.sort(strings)); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |