Data Structures and Other Objects Using JavaThis book takes a gentle approach to the data structures course in Java. It offers an early, self-contained review of object-oriented programming and Java to give students a firm grasp of key concepts, and allows those experienced in other languages to adjust easily. The book also offers a flexibility which allows professors such options as emphasizing object-oriented programming, covering recursion and sorting early or accelerating the pace of the course. This title meets the needs of professors searching for a book to balance the introduction of object-oriented programming and data structures with Java. The new edition has been updated to cover Java 1.3 and includes new appendices with more reference material on such topics as Java collections. It also features increased coverage of object-oriented programming and inheritance. New exercises on radix sort and shell sort have also been added. |
From inside the book
Results 1-3 of 74
... target ( i.e. , target ! = data [ index ] ) . Each time through the loop , the index is incremented by one . No other work is needed in the loop . But take a careful look at the expression data [ index ] in the boolean test of the loop ...
... target in the data array . // If target is not in the array , then index will be set equal to manyltems . if ( target == null ) { // Find the first occurrence of the null reference in the bag . index = 0 ; while ( ( index < manyItems ) ...
... ( target ) ; The local variable answer is a boolean variable to keep track of whether the recursive call actually removed the target . If looseRemove did remove the target from subset [ i ] , then we are left with the problem that the ...
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown