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 16
... heapsort , that combines the time efficiency of mergesort and the storage efficiency of quicksort . Like mergesort , heapsort has a worst - case running time that is O ( n log n ) , and like quicksort , it does not require an additional ...
... heapsort algorithm with this specification : heapsort public static void heapsort ( int data [ ] , int n ) Sort an array of integers from smallest to largest . Parameters : data the array to be sorted n the number of elements to sort ...
... heapsort algo- rithm . As usual , we take the problem size n to be the number of elements to be sorted . If you look ... heapsort average case for heapsort Building the An O ( n log n ) Algorithm Using a Heap 633 Heapsort-Analysis.
Contents
CHAPTER | 2 |
LEARNING OBJECTIVES | 14 |
Java Classes and Information Hiding | 40 |
Copyright | |
44 other sections not shown