Data Structures and Other Objects Using JavaThis 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. The new edition has been updated to cover Java 1.3 and includes new appendices with more reference material on such topics as Java collections. It also features increased coverage of object-oriented programming and inheritance. New exercises on radix sort and shell sort have also been added. |
From inside the book
Results 1-3 of 11
... Quicksort Running Time The worst - case running time of quicksort is O ( n2 ) but the average - case running time and the best - case running time for quicksort are both O ( n log n ) . Obtaining a good running time requires the choice ...
... quicksort method in Figure 12.5 on page 617 produces its worst- case running time when the array is already sorted . Suppose you know that the array might already be sorted or almost sorted . How should you modify the algorithm for ...
... quicksort , the resulting time is O ( n log n ) . When there is bad splitting in quicksort , the result can be qua- dratic time . 7. See " Quicksort - Choosing a Good Pivot Ele- ment " on page 623 . 8. Your new quicksort method should ...
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown