Data Structures and Other Objects Using Java
Michael Main's gentle approach to data structures and objects has introduced thousands of beginning programmers to foundational data structures using the practical Java language. This Third Edition makes the most of the enhancements and advantages of Java 5.0 including the use of generic data types. An early group of chapters reviews the key aspects of object-oriented programming giving students the foundation for understanding significant programming concepts. With this framework they are able to accomplish writing functional data structures by using a five-step method for working with data types; understanding the data type abstractly, writing a specification, using the data type, designing and implementing the data type, and analyzing the implementation. Students learn to think analytically about the efficiency and efficacy of design while gaining exposure to useful Java classes libraries. The flexibility of Data Structures and Other Objects Using Java allows instructors to structure their course around a certain emphasis, such as early coverage of recursion and sorting, or to accelerate the pace of the course.
13 pages matching heapsort in this book
Results 1-3 of 13
What people are saying - Write a review
We haven't found any reviews in the usual places.
The Phases of Software Development
32 other sections not shown
Other editions - View all
Accessor method activated addAl algorithm applet arithmetic overflow array B-tree binary search tree binary tree Celsius Chapter clone method collection class computation constructor contains copy create current element cursor data type double numbers empty example expression extended class Figure graph hash table head reference heap heapsort Indicates insufficient memory information hiding initial capacity input IntArrayBag integer interface IntNode iterator Java Java's Javadoc linked list Location loop manyItems mergesort method returns node null reference number of elements number of operations object package parameter position Postcondition pre-order traversal Precondition priority queue private instance variables pseudocode public boolean public class public int public static void public void quicksort recursive call reference variable remove return value returns true root Self-Test Exercises sequence shown simulation specified stack statement static method step stored string subtree Suppose target Throttle Throws TreeMap vertex vertices write zero