Category: sorting c

Merge sort in java

Merge Sort Program in c

Merge Sort: Merge sort is based on the divide and conquer technique. In merge sort unsorted array is divided in half again and again ,until each array contain 1 element. Divided list are merged...

Heap sort in java

Heap Sort Program in c

Heap Sort: #include <stdio.h> #include <conio.h> void makeheap ( int [ ], int ) ; void heapsort ( int [ ], int ) ; void main( ) { int arr[10] = { 11, 2,...

Insertion sort in java

Insertion Sort program in C

Insertion Sort: Insertion sort is somewhat similar to selection but in insertion sort one element is selected from unsorted array and placed at proper location in sorted array. Worst case performance:     О(n2)...

Quick Sort in java

quick sort program in c

Quicksort: In quick sort one element is selected as a pivot from array.Using pivot array is divided into two parts elements less than pivot and greater than pivot. procedure is done until array get...