Java Software Structures: Designing and Using Data Structures
The second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms.
Results 1-3 of 14
A sort is based on some particular value, called the sort key. For example, a set of
people might be sorted by their last name. A radix sort, rather than comparing
items by sort key, is based on the structure of the sort key. Separate queues are ...
Let's look at an example that uses a radix sort to put ten three-digit numbers in
order. To keep things manageable, we'll restrict the digits of these numbers to 0
through 5, which means we'll need only six queues. Each three-digit number to
7.4 USING GNUEUES: RADIX SORT 225 Digit 1s Position 10s Position 100s
Position front front front 0 420 250 503 102 | 1 341 312 145 143 102 E. - 2 102
312 442 * | 420 | 250 3 143 503 341 325 312 4 145 143 442 341 442 420 5 325
What people are saying - Write a review
17 other sections not shown