Data Structure › Time Complexity › Question #15258
MCQ Single Best Answer Easy

QWhat is the time complexity of a radix sort algorithm for sorting an array of n elements with k digits in the worst case?

ID: #15258 Time Complexity 143 views
Question Info
#15258Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(1) ✔ ✖
  • B O(log n) ✔ ✖
  • C O(n) ✔ ✖
  • D O(nk) ✔ ✖
Correct Answer: Option D

Explanation

Radix sort is a non-comparative sorting algorithm that sorts elements by their individual digits or bits. In the worst case, where the number of digits (k) is constant, radix sort performs counting sort or bucket sort on each digit. Since each counting sort or bucket sort takes linear time (O(n)), and there are k digits to sort, the overall time complexity becomes O(nk).

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of a depth-first search (DFS) algorithm on a directed acyclic graph (DAG) with V v What is the time complexity of a merge sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a delete operation in a binary heap in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a bubble sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a linear search algorithm for an unsorted array of n elements in the worst case What is the time complexity of a binary search algorithm for finding an element in a sorted array of n element What is the time complexity of a quicksort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges?