Radix Sort
Sign in to Google to save your progress. Learn more
Email *
Student ID *
Student Name *
What's your colleges?
Clear selection
Radix sort is a _______ sorting algorithm.
 *
Match the following descriptions with the correct sorting algorithm (radix sort, heap sort, merge sort, insertion sort, or quick sort):
 *
Insertion sort
Quick sort
Merge sort
Heap sort
Radix sort
Sorts elements by processing digits individually
Builds a binary heap to sort the elements
Uses a divide and conquer approach
Requires additional memory to store subarrays
Has an average case time complexity of O(n log n)
Has a worst-case time complexity of O(n^2)
Has an average case time complexity of O(nk)

Given the following list of integers, show the steps of radix sort to sort the list in ascending order. Sorting by the least significant digit.

*
[2, 24, 45, 66, 75, 90, 170, 802]
[170, 90, 802, 2, 24, 45, 75, 66]
[802, 2, 24, 45, 66, 170, 75, 90]
Step 1
Step 2
Step 3
Which sorting algorithms are stable? *
Required
Match the following applied scenarios with the appropriate sorting algorithms.
*
A. Heap sort
B. Merge sort
C. Quick sort
D. Insertion sort
E. Radix sort
a. You need to sort a small dataset, which is mostly sorted, and you want an internal sorting algorithm.
b. You are working with a large dataset that does not fit in memory, and you need to perform an external sort.
c. You have to sort a large dataset with integer keys in a fixed range.
d. You need to sort an array in a space-critical application, and you want to minimize the worst-case time complexity.
e. You are looking for an internal sorting algorithm that provides a good average-case time complexity.
Submit
Clear form
Never submit passwords through Google Forms.
reCAPTCHA
PrivacyTerms
This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

Does this form look suspicious? Report

Google Forms