Queue in data structure : Queue is a linear type of data structure. Queue is an unordered group of element in which element are added at one end (rear end) and removed from one end (front end). This data structure commonly known as FIRST IN FIRST OUT(FIFO). Example:- Queue in a ticket counter or line […]

## Stack

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 […]

## Shell Sort

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 the Insertion sort technique. Shell sort technique In this shell sort technique, We have an N number of a list which is unsorted in this technique, We consider the […]

## Merge Sort

Merge Sort is one of the sorting techniques in the data structure. It is a simple technique to sort the element. merge sort is also used for sorting two individual unsorted lists to the sorted list. It merges the list. and we will see Merge sort program in c with an explanation. Merge sort technique In […]

## Insertion Sort

Insertion sort is a one of the sorting technique used for sorting the elements. Insertion sort technique In this Insertion sort technique, Sorting of the element is performed by adding the element to the existing sorted list. In this technique initially, we are having only one element in a list after this we gradually insert […]