Data Structures and Algorithms in Java
Using a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text.
Includes CD-ROM with... The Microsoft Visual J++ programming environment.
Results 1-3 of 18
each primitive operation, we will simply count how many primitive operations are
executed, and use this number t as a high-level estimate of the running-time of
the algorithm. This operation count will correlate to an actual running time in a ...
We shall say that algorithm arrayMax executes t(n) = 7/7 — 3 primitive operations
in the worst case, meaning that the maximum number of primitive operations
executed by the algorithm, taken over all inputs of size /?, is In — 3. This type of ...
We also view an operation as a sequence of constant time primitive operations,
which each cost one cyber-dollar to be executed. When an operation is executed,
we should have enough cyber-dollars available to pay for its running time.
What people are saying - Write a review
LibraryThing ReviewUser Review - daschaich - LibraryThing
Third edition is much improved: When I learned that this was the required book for my introductory data structures class this semester, I was somewhat worried by the large number of very negative ... Read full review
Stacks Queues and Linked Lists
19 other sections not shown