0

6.7kviews

Compare and contrast Quicksort and Radix sort on basis of their advantage and disadvantages.

written 8.5 years ago by teamques10 ★ 68k

•   modified 7.1 years ago

Mumbai University > COMPS > Sem 3 > Data Structures

Marks: 5 M

Year: Dec 2014

data structures and algorithms

ADD COMMENT FOLLOW SHARE EDIT

For 5 marks 3 points would be sufficient?

7.1 years ago by teamques10 ★ 68k

---

1 Answer

0

332views

written 8.5 years ago by teamques10 ★ 68k

Quick Sort	Radix sort
Quick sort compares the item values against each other	Radix sort simply sorts by the binary representation of data. The items(as a whole) are never compared
The running time is O(n log n)	The running time is O(kn) where k is the number of digits in the largest number which is very fast
It is massively recursive	It has very less of recursion.

ADD COMMENT SHARE EDIT