Linked List

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 …

Linked List Read More »

Quick sort

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 …

Quick sort Read More »

Heap Sort

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 …

Heap Sort Read More »

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

Shell Sort Read More »

Merge Sort

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 …

Merge Sort Read More »

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 a …

Insertion Sort Read More »