Anonymous user
Sorting algorithms/Strand sort: Difference between revisions
→{{header|Java}}
(GP) |
|||
Line 42:
LinkedList<E> sorted = new LinkedList<E>();
sorted.add(list.removeFirst()); //same as remove() or remove(0)
for(
E elem =
if(sorted.peekLast().compareTo(elem) <= 0){
sorted.addLast(elem); //same as add(elem) or add(0, elem)
}
}
|