DS

Merge sort (External sort)

Merge sort (External sort) In external sorting process, some part of the data is held in primary memory during the sorting process and ...

MERGE SORT #include<stdio.h> void mergeSort(int arr[ ],int low, int mid, int high); void partition(int arr[ ],int low, int hig...

QUICK SORT #include<stdio.h> #include<conio.h> void qsort(int [ ], int, int); void main() { int a[10], n, i...

SELECTION SORT #include<stdio.h> #include<conio.h> void main() { int size, i, j, temp, a[100]; clrscr(); ...

INSERTION SORT #include<stdio.h> #include<conio.h> void main() { int a[100], n, temp, i, j; printf...

BUBBLE SORT #include<stdio.h> #include<conio.h> void main() { int i, j, n, a[10],temp; clrscr(); printf(...

Quick sort } Quick sort is a sorting technique designed based on the divide-and-conquer method. In this sorting technique, array eleme...

Pages 1 of 4 12 3 4 Next