There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply () below.
If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.
Join the Discussion. Help a fellow learner on their journey.
Ask or answer a question about this exercise by clicking reply () below!
You can also find further discussion and get answers to your questions over in Language Help.
Agree with a comment or answer? Like () to up-vote the contribution!
I tried to apply this selection sort to a linked list instead of an array.
But instead of switching the minimum with the first unsorted element, I just inserted the minimum element of the unsorted part immediately after the sorted elements.
I kept track of nodes instead of indices.
code
public static void selectionSort(LinkedList list) {
Node lastSorted = null; // last node in sorted part
Node current = list.head; // current node
while (lastSorted != null || current != null) {
// find minimum after lastSorted
if (lastSorted != null) {
current = lastSorted.getNextNode();
}
if (current == null) {
break;
}
Node nodeOfMinimum = current;
Comparable minimum = current.data;
Node nodeBeforeMinimum = lastSorted;
Node previous = current;
current = current.getNextNode();
while(current != null) {
Comparable value = current.data;
if (value.compareTo(minimum) < 0) {
nodeOfMinimum = current;
minimum = value;
nodeBeforeMinimum = previous;
}
previous = current;
current = current.getNextNode();
}
if (lastSorted != nodeBeforeMinimum) {
// remove nodeOfMinimum from list
if (nodeBeforeMinimum != null) {
Node nodeAfterMinimum = nodeOfMinimum.getNextNode();
nodeBeforeMinimum.setNextNode(nodeAfterMinimum);
}
// insert nodeOfMinimum after lastSorted
if (lastSorted != null) {
Node afterLastSorted = lastSorted.getNextNode();
lastSorted.setNextNode(nodeOfMinimum);
nodeOfMinimum.setNextNode(afterLastSorted);
}
}
// updateLastSorted
if (lastSorted == null) {
// if haven't sorted anything yet, nodeOfMinimum becomes the head
lastSorted = nodeOfMinimum;
Node oldHead = list.head;
if (oldHead != nodeOfMinimum) {
list.head = nodeOfMinimum;
nodeOfMinimum.setNextNode(oldHead);
}
}
else {
lastSorted = lastSorted.getNextNode();
}
//lastSorted = nodeOfMinimum;
}
}