The standard ASCII table contains 128 character codes which include upper case a

Question

The standard ASCII table contains 128 character codes which include upper case alpha, lower case alpha, the decimal digits, some special characters, and control characters. The extended ASCII table contains an additional 128 special characters and primitive “drawing” characters. Using the radix sort how many queues would be required for each pass to sort an array of 5,000 strings that could contain up to 10 characters each with any character being taken from the combined standard ASCII standard and ASCII extended tables? How many passes will be required? Big 0 for the radix sort is different from the other algorithms we have studied. Why is it different? Describe two factors that affect the efficiency of any given radix sort.

Explanation / Answer

The radix sort is based on the digits or characters comprising the items to be
sorted.We start arranging the least significant position and then repeat this for
other digits. If there are n items of length d then the coplexity will be 'of
O(dn).The efficiency of radix sort as compatred to other comparion based
algoriths is hard to decide. One of the factor affecting the efficiency is
number of digits or d.If d is constant radix sort becomes better than other
alorithms for large n.But in general we will not have w as constant.The other factor is choice of least significant digit radix sort or most significant digit
radix sort. Depending on the items both have their own implications.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.