McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2025
→
Computer Science Engineering (CSE)
→
Data Structures (DS)
→
Searching, Sorting and Hashing Technique...
→
What is the worst case time complexity o...
Q.
What is the worst case time complexity of LSD radix sort?
A.
O(nlogn)
B.
O(wn)
C.
O(n)
D.
O(n + w)
Answer» B. O(wn)
1.8k
0
Do you find this helpful?
5
View all MCQs in
Data Structures (DS)
Discussion
No comments yet
Login to comment
Related MCQs
LSD radix sort requires passes to sort N elements.
Which of the following is true for the LSD radix sort?
Which of the following is a combination of LSD and MSD radix sorts?
What is the worst-case time for heap sort to sort an array of n elements?
What is the worst case complexity of bubble sort?
What is the worst case complexity of selection sort?
What is the best case and worst case complexity of ordered linear search?
What is the worst case time complexity of inserting a node in a doubly linked list?
The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
