Data Structures & Other Objects Using Java
This 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.
Results 1-3 of 56
Except for two declarations and two statements, all of the work in
countOccurrences happens in this loop: for (index = 0; index < manyItems; index
++) if (target == data[index]) answer++; We can see that the body of the loop will
be executed ...
addNodeAfter(source.data) ; copyTai l = copyTail .link; 4. After Step 3 completes,
return copyHead (a reference to the head node of the list that we created). Step 3
of the pseudocode is completely implemented by this loop: while (source. link ...
The method then uses a loop to advance i through the possible indexes. Within
the loop, we check whether we have found the index of the specified key. If so,
we immediately return the value of i . On the other hand, if the loop determines
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown