## Java Software Structures: Designing and Using Data StructuresThe second edition of |

### From inside the book

Results 1-3 of 14

Page 222

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

items by sort key, is based on the structure of the sort key. Separate queues are ...

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 comparingitems by sort key, is based on the structure of the sort key. Separate queues are ...

Page 224

Let's look at an example that uses a

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

be ...

Let's look at an example that uses a

**radix sort**to put ten three-digit numbers inorder. 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

be ...

Page 225

7.4 USING GNUEUES:

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

145 ...

7.4 USING GNUEUES:

**RADIX SORT**225 Digit 1s Position 10s Position 100sPosition 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

145 ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Software Development | 2 |

ObjectOriented Design | 30 |

Collections | 83 |

Copyright | |

17 other sections not shown

### Other editions - View all

Java Software Structures: Designing & Using Data Structures John Lewis,Joseph Chase No preview available - 2005 |

### Common terms and phrases

abstract add add add addElement ancestor tree array implementation ArrayList AVL tree B-tree binary search tree binary tree boolean button called Card Chapter complexity constructor contains count create data structure deckSet defined dequeue disks doubly linked list element stored empty enqueue example expression tree Figure hash table hashing function heap ImageIcon insertion insertion sort integer interface isEmpty iterator Java Collections API jss2 Key Concept left child Lewis/Chase linear linked implementation linked list loop merge sort method node null number of elements operation ordered list parameter parent path position postfix expression problem provides public class public void queue radix sort rear recursive reference variable remove represent return result Returns true right child root Self-Review Questions set collection sort algorithm stack static String subtree System.out.println target element temp tion toString traversal UML description undirected graph unordered list vertex vertices waterfall model web crawler