Data Structures and Problem Solving Using JavaFeatures *Contains extensive sample code using Java 1.1, which is available over the Internet and has been tested and reviewed by a professional programmer for accuracy. *Provides an introduction to Java in Part I and also covers Graphical User Interfaces (GUIs) in an appendix. *Includes pedagogical aids such as margin notes and comprehensive end-of-chapter material to help readers grasp challenging concepts. *Offers flexibility in topic coverage by minimizing dependencies among the different chapters. |
Other editions - View all
Common terms and phrases
abstract class alpha-beta pruning analysis array base class basic Big-Oh binary search tree boolean BufferedReader chapter Comparable compute constant constructor contiguous subsequence sum data structures declared derived class element equal error evaluate example exception final class findMin for(int function hash table Hashable implementation important information hiding inheritance initial input insertion sort instance IntCell integers interface interpolation search ItemNotFound iterations Java javadoc linear linked list logarithmic loop maximum contiguous subsequence MemoryCell mergesort MyInteger node O(N log object object-oriented object-oriented programming operations output package parameter partitioning performed permutation pivot position primitive types priority queue private static problem public class public static void quadratic quickselect quicksort random numbers recursive calls reference types result rithm routine running sequence Shape Shellsort shown in Figure solve sorting algorithm stack statement static final stored String System.out.println Theorem tion toString variable worst-case write