I have this code below where I am inserting a new integer into a sorted LinkedList of ints but I do not think it is the \"correct\" way of doing things as I know there are s
If we use listIterator the complexity for doing get will be O(1).
public class OrderedList> extends LinkedList {
private static final long serialVersionUID = 1L;
public boolean orderedAdd(T element) {
ListIterator itr = listIterator();
while(true) {
if (itr.hasNext() == false) {
itr.add(element);
return(true);
}
T elementInList = itr.next();
if (elementInList.compareTo(element) > 0) {
itr.previous();
itr.add(element);
System.out.println("Adding");
return(true);
}
}
}
}