In: Computer Science
Consider the following list of names: PEVAC, MARKOV, ZLATAREVA, ABDOLLAHZADEH, CHEN, WILLIAMS, ALBAYRAM, KURKOVSKY, ZABIHIMAVAN. Use Radix sort to sort them in alphabetic order. How many passes would be made through the outer while loop? Trace the contents of the list after each of these passes
N RADIX SORT, THE NUMBER OF ITERATIONS OR PASSES IS EQUAL TO THE LENGTH OF LONGEST STRING.
HERE, THE LONGEST STRING IS 'ABDOLLAHZADEH'.
SO, THE NUMBER OF PASSES FOR OUTER WHILE LOOP IS 13.
PLEASE LIKE IT RAISE YOUR THUMBS UP
IF YOU ARE HAVING ANY DOUBT FEEL FREE TO ASK IN COMMENT
SECTION