## Sorting – Merge Sort

Sorting – Merge Sort Merging:- Merging is the process of combining two or more sorted files into a third sorted file. An example of a routine that accepts two sorted arrays a and b of n1 and n2 elements respectively and merges them into a third array c containing n3 (n1+n2) elements. Steps for Merge Sort: Divide the file n subfiles of size 1 and merge adjacent pair of files….

Read more...## Sorting – Radix Sort

are closed

Sorting – Radix Sort Radix Sort sorts the number in scans equal to the number of digits of maximum number. eg. 45, 3, 235, 89, 150, then maximum scans = 3. Thus radix sort operates three times. Radix sort uses 10 queues to sort the given numbers. Begin with least significant digit, ending with most significant digit. Fetch a number from the array and place it in one of the…

Read more...
are closed