Stack is linear type of Data Structure. Stack works on a FIRST IN LAST OUT or LAST IN FIRST OUT fashion. Lets see example stack meaning Stack Example Consider an container or CD’S that is we put CD’S on one another and if we want to take CD’S out then we have to remove the CD which is at the …
Singly non circular linked list As we learn the basic of linked list in a previous tutorial we got a basic idea of implementing linked list. Singly non circular linked list is a one type of linked list where singly linked list means we are having a node with data and its next node address …
Linked list is a linear type of data structure. It is a set of data which has data along with the address stored in it. Linked list store the data and address in a node. Node:- Node is a combination of data and the next (address of next node). Linked list is a collection of node …
As we learned in a previous tutorial the basic of doubly linked list. The doubly linked list means we create a node with a 3 field which stores data and two address pointer as a previous and next node address. Doubly circular state that our end node will point to start node and start node …
Doubly Non Circular linked list is another type of linked list. The doubly Non Circular linked list is a type of linked list where a node contains 3 field one contains data in node and two pointers which stores the address of previous and next node as shown below. As we seeing the non circular …
As in previous tutorial we learned the basic of singly linked list as what is linked list and how it created now we will see singly circular linked list. The singly linked list is the node which contain the data and address. As linked list we seen that the address field container address of a next node, But …
In this tutorial, we will see another sorting technique which is Quick sort and Quick Sort Program in C. Quick sort: Quick sort is the fastest internal sorting algorithm without any additional memory for sorting data. In quick sort, first, we choose the key element in the list which is called Pivot element. Then we reorder the list with the rule …
heap sort in data structure It is a much more efficient version of selection sort it also works by determining the largest element of the list, placing that at the end (or beginning) of the list then continuing with the rest of all list, by accomplishes this task efficiently by using a data structure called HEAP. This …
Shell sort is a one of the sorting technique. It is a rarely used technique as it seems difficult for implementing. Shell sort is based on Insertion sort technique. Shell sort technique In this shell sort technique, We have a N number of list which are unsorted in this technique, We consider the N number in …
Merge Sort is a one of the sorting techniques in data structure. It is a simple technique to sort the element. Merge is also used for sorting two individual unsorted list to sorted list. It merge the list. Merge sort technique In this technique we have a N number of unsorted list in this, We divide …
