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 13
So the Hwsr-case running time for quicksort is quadratic. Despite a poor worst-
case time, quicksort generally is quite good. In fact, the average time (which we
won't develop) turns out to be 0(n log n). This is the same as mergesort, and we ...
stopping recursion before the pieces get too small The quicksort method in
Figure 12.5 on page 595 produces its worst- case running time when the array is
already sorted. Suppose you know that the array might already be sorted or
4. quicksort(data, 222, 100); 5. Mergesort always makes recursive calls to sort
subarrays that are about half the size of the original array, resulting in 0(n log n)
time. 6. When there is good splitting in quicksort, the resulting time is 0(n log n).
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown