- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Which of the following is true for the L...

Q. |
## Which of the following is true for the LSD radix sort? |

A. | works best for variable length strings |

B. | accesses memory randomly |

C. | inner loop has less instructions |

D. | sorts the keys in left-to-right order |

Answer» B. accesses memory randomly |

View all MCQs in:
Data Structures (DS)

- LSD radix sort requires passes to sort N elements.
- What is the worst case time complexity of LSD radix sort?
- Which of the following is a combination of LSD and MSD radix sorts?
- 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?
- 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 with improvised version?
- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
- What is the worst-case time for heap sort to sort an array of n elements?

Login to Continue

It will take less than 2 minutes

Report MCQ