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 70
If the largest term in the formula is a constant times «, then the algorithm is said to
be "big-0 of n," written O(n), and the algorithm is called linear. In a linear
algorithm, doubling the input size makes the time increase by approximately
twofold (or ...
In this section, we will present an algorithm to translate an infix expression to a
postfix expression. The algorithm's input is an expression in infix notation, and
the output is an equivalent expression in postfix notation. We will develop the ...
Pitfall: Common Indexing Errors in Binary Search Implementations Binary search
and similar array-based algorithms are notorious for having errors involving the
array indexes. A common place for an error is the calculation of the size of the ...
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown