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 58
dependence on input size simplification of the time analysis for Technique 2
going up and down stairs. The number of operations used by each of the
techniques is summarized here: Doing a time analysis for a program is similar to
They computed the exact number of operations for each technique. But such
precision is sometimes not needed. Often it is enough to know in a rough manner
how the number of operations is affected by the input size. In the stair example,
Using big-0 notation, we can express the time requirements of our three stair-
counting techniques as follows: Technique 1 O(n) Technique 2 0(n2) Technique
3 0(log n) order of an When a time analysis is expressed with big-0, the result is ...
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown