Heap sort heap sort in data structure It is 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 […]

## Quick sort

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 list which is called Pivot element. Then […]

## Binary Search Tree in C

Implement Binary search tree in c Binary search tree (BST) is a binary tree in which each node has value greater than every node of left subtree and less than every node of right subtree. It is very useful data structure in which item can be searched in O(log N) where N is number of […]

## Doubly Circular Linked List

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

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

- 1
- 2
- 3
- 4
- Next Page »