i have a single list program which i need to sort the nodes of int and String type unsing only one of these algorithms (insertion, selection, bubble and shell). no merge or quick or using collections and stuff.
i'm having a difficulty here, i only know how to implement them on an Array, but not on a L.L!
i don't know how to start! if anyone has an example where i can see how it can be implemented,it would be great.
