Singly linked lists

Today, we had a guest teacher due to Mr. Arkin’s absence. The class was working on Insertion Sort of a card-dealing problem. Since I was not aware of this sorting algorithm, I tried the question as well and got a sense of the algorithm. After, the advanced crew was given a main method as a continuation of the  Node class to implement an array of integers into nodes but should link each other in the sorted order. Using methods of the node class made the task a little bit easier. I feel relieved after finishing all the French projects due today which gives me more time to continue working on my code. The singly linked list runs in one direction so I assume that we are soon going to begin doubly linked lists. I can’t wait!