What are the advantages and disadvantages of radix sort?

Answer 1

Advantages:

• Easy to implement
• In-place sort (requires no additional storage space)
  

Disadvantages:

• Doesn't scale well: O(n2)
  

Answer 2

Insertion sort provides several advantages:

Simple implementation.

Efficient for (quite) small data sets.

Adaptive, i.e. efficient for data sets that are already substantially sorted: the time complexity is O(n + d), where d is the number of inversions.

More efficient in practice than most other simple quadratic, i.e. O(n2) algorithms such as selection sort or bubble sort; the best case (nearly sorted input) is O(n).

Stable, i.e. does not change the relative order of elements with equal keys

In-place, i.e. only requires a constant amount O(1) of additional memory space

Online, i.e. can sort a list as it receives it.

Disadvantages of insertion sort;

It is less efficient on list containing more number of elements.

As the number of elements increases the performance of the program would be slow.

Insertion sort needs a large number of element shifts

Answer 3

advantages

Counting-sort is very efficient for sorting an array of integers when the length, n, of the array is not much smaller than the maximum value, k 􀀀 1, that appears in the array. The radix-sort algorithm, which we now describe, uses several passes of counting-sort to allow for a much greater range of maximum values.

Answer 4

merge sort is the most efficient way of sorting the list of array.