Scribd
Upload
231 views1 page

Radix Sort and Insertion Sort

Radix sort has a best case time complexity of O(dn) and worst case time complexity of O(n^2) or O(logb(mx)(n+b)). Insertion sort has a best case time complexity of O(n) and worst case time complexity of O(n^2).

Uploaded by

Rishika Agrawal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
231 views1 page

Radix Sort and Insertion Sort

Radix sort has a best case time complexity of O(dn) and worst case time complexity of O(n^2) or O(logb(mx)(n+b)). Insertion sort has a best case time complexity of O(n) and worst case time complexity of O(n^2).

Uploaded by

Rishika Agrawal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

State the best case and worst case time complexity of the radix sort and insertion

sort algorithms.
(2 marks)
SOLUTION:
Time Complexity of Radix Sort Algorithm:
The time complexity of radix sort is given by the formula,T(n) = O(d*(n+b)), where
d is the number of digits in the given list, n is the number of elements in the
list, and b is the base or bucket size used, which is normally base 10 for decimal
representation.
Best Case - The best case occurs when all elements have the same number of digits.
The best case time complexity is O(d(n+b)). If b = O(n), then time complexity is
O(dn).
Worst Case - The worst case in radix sort occurs when all elements have the same
number of digits except one element which has a significantly large number of
digits. If the number of digits in the largest element is equal to n, then the
runtime becomes O(n2). The worst case running time of Counting sort is O(n+b). If
b=O(n), then the worst case running time is O(n). Here,the countingSort function is
called for d times, where d = [logb(mx)+1]. Total worst case complexity of radix
sort is O(logb(mx)(n+b)).

Time Complexity of Insertion Sort Algorithm:


Insertion sort performs two operations: it scans through the list, comparing each
pair of elements, and it swaps elements if they are out of order. Each operation
contributes to the running time of the algorithm.
Best Case - If the input array is already in sorted order, insertion sort compares
O(n)O(n) elements and performs no swaps. Therefore, the time complexity of the best
case is O(n).
Worst Case - The worst case for insertion sort will occur when the input list is in
decreasing order. To insert the last element, we need at most n-1 comparisons and
at most n-1 swaps. To insert the second to last element, we need at most n-2
comparisons and at most n-2 swaps, and so on. The number of operations needed to
perform insertion sort is therefore: 2 * (1+2+ ... +n-2+n-1). To calculate the
recurrence relation for this algorithm, use the following summation:
∑_p^(q=1) q=(p(p+1))/2 . It follows that (2(n-1)(n-1+1))/2=n(n-1)
The worst case time complexity of Insertion sort is O(n2)

You might also like