NonComparisionSorts

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: itional representations of the numbers being being sorted ! Determining which of two integers of equal Determining length length is larger: ! – Start at the most significant digit and advance Start through through the least-significant digits as long as the least-significant the corresponding corresponding digits in the two numbers match – The number with the larger digit in the first position The in which the digits of the two numbers do not match is is the larger of the two numbers – If all digits of both numbers match, the numbers are If equal equal 10 “Radix Sort”: intuitive implementation ! ! ! ! ! Sort Sort numbers into the right buckets (bins) based based on their most significant digit Sort each of the resulting bins recursively Combine the sorted bins Have Have to put aside the remaining bins when we sort sort each bin Generate Generate many intermediate bins that must be kep...
View Full Document

This document was uploaded on 03/06/2014 for the course ECE 368 at Purdue University-West Lafayette.

Ask a homework question - tutors are online