Blogged By: Joshy Joseph
In today’s class we discussed singly linked and the doubly linked list. And also the ways of deleting and freeing the memory space of such elements without extensive traversal within the list.
In singly linked list we can delete the only node by using the current->link = null. If in case more
than one node is there we use current->link->link =null to find the last node of the list and after
identifying the last node we will delete that node by making the previous node point to null.
In doubly linked list when only when one node is there we will make current point to null. If there are more than one node we will find the last node and make current point to previous i.e., current = current -1 then after that we will make current point to null.
Then we talked about quick sort algorithm and Sir explained the same using the Sorting Excel Sheet prepared to explain the same. Further reference you can follow this link:
Quicksort
We finished with a small quiz using a Java App which showed the different way the Sorts Worked, students were able to judge Selection, Bubble and Quick Sort from the way distribution was done
No comments:
Post a Comment