Rosetta Code

Sorting algorithms/Bogosort: Difference between revisions

Page Discussion

Sorting algorithms/Bogosort (view source)

Revision as of 04:44, 9 May 2008

259 bytes added ,  16 years ago
→‎{{header|Java}}: minor changes
(+D)
(→‎{{header|Java}}: minor changes)
Line 65:
This implementation works for all comparable types (types with <tt>compareTo</tt> defined).
<java>import java.util.Collections;
import java.util.LinkedListList;
import java.util.Iterator;
 
public class Bogosort<T extends Comparable<T>> {
private static <T extends Comparable<? super T>> boolean isSorted(List<T> list) {
public LinkedList<T> bogoSort(LinkedList<T> list){
if (list.isEmpty())
boolean sorted= false;
return true;
while(!sorted){
Iterator<T> it = list.iterator();
sorted= true;
T last = it.next();
for(int i= 0;i < list.size() - 1;i++){
while (it.hasNext()) {
if(list.get(i).compareTo(list.get(i + 1)) > 0){
T current = it.next();
sorted= false;
if (last.compareTo(current) > 0)
}
return false;
}
last = current;
}
return true;
}
 
public static <T extends Comparable<? super T>> void bogoSort(List<T> list) {
if(!sorted){
while (!isSorted(list))
Collections.shuffle(list);
}
}
}
return list;
}
}</java>
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/72102"