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
a.length alpha-beta pruning analysis array base class basic Big-Oh binary search tree boolean BufferedReader chapter Comparable constant constructor contiguous subsequence sum data structures declared derived class element equal Equation error evaluate example exception for(int function hash table Hashable implementation important inheritance initial input insertion sort instance IntCell integers interface interpolation search iterations Java javadoc linear linked list logarithmic loop maximum contiguous subsequence mergesort MyInteger node O(N log object object-oriented object-oriented programming operator output package parameter partitioning performed permutation pivot position postfix primitive types priority queue private static problem proof public class public static void quadratic quickselect quicksort random numbers randomized algorithm recursive calls reference types result rithm routine running sequence Shellsort shown in Figure shows solve sorting algorithm stack statement static final int stored String symbol System.out.println Theorem tic-tac-toe tion toString transposition table variable worst-case Write