Data Structures & Other Objects Using JavaThe Phases of Software Development Specification, Design, Implementation Running Time Analysis Testing and Debugging Abstract Data Types and Java Classes Classes and Their Members Using a Class Packages Parameters, Equals Methods, and Clones Collection Classes A Review of Java Arrays An ADT for a Bag of Integers Programming Project: The Sequence ADT Applets for Interactive Testing Linked Lists Fundamentals of Linked Lists Methods for Manipulating Nodes Manipulating an Entire Linked List The Bag ADT with a Linked List Programming Project: The Sequence ADT with a Linked List Arrays vs. Linked Lists vs. Doubly Linked Lists Java Objects and Iterators Java's Object Type A Bag of Objects JCL Collections and Nodes of Objects Iterators Stacks Introduction to Stacks Stack Applications Implementations of the Stack ADT More Complex Stack Applications Queues Introduction to Queues Queue Applications Implementations of the Queue ADT Priority Queues Recursive Thinking Recursive Methods Studies of Recursion: Fractals and Mazes Reasoning about Recursion Trees Introduction to Trees Tree Representations A Class for Binary Tree Nodes Tree Traversals Binary Search Trees Tree Projects Heaps B-Trees Trees, Logs, and Time Analysis Searching Serial Search and Binary Search Open-Address Hashing Using Java's Hashtable Class Chained Hashing Time Analysis of Hashing Sorting Quadratic Sorting Algorithms Recursive Sorting Algorithms An O(N LOG N) Algorithm Using a Heap Software Reuse with Extended Classes Extended Classes Simulation of an Ecosystem Using Extended Classes for ADTs Graphs Graph Definitions Graph Implementations Graph Traversals Path Algorithms Appendices Java's Primitive Types and Arithmetic Overflow Java Input Throwing and Catching Java Exceptions Java's Vector and Hashtable A Class for Nodes in a Linked List A Class for a Bag of Objects Further Big-O Notation Javadoc. |
From inside the book
Results 1-3 of 13
Page 602
... 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 , 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 ...
Page 605
... heapsort is to rearrange the array elements so that the corresponding com- plete binary tree is a heap . For the ten - element example that we have just seen , the first step of the heap- sort might rearrange the array so that the ...
... heapsort is to rearrange the array elements so that the corresponding com- plete binary tree is a heap . For the ten - element example that we have just seen , the first step of the heap- sort might rearrange the array so that the ...
Page 608
... Heapsort for the array called data with n elements 1. Convert the array of n elements into a heap . 2. unsorted = n ... Heapsort Implementation public static void heapsort ( int [ ] data , int n ) { int unsorted ; // Size of the unsorted ...
... Heapsort for the array called data with n elements 1. Convert the array of n elements into a heap . 2. unsorted = n ... Heapsort Implementation public static void heapsort ( int [ ] data , int n ) { int unsorted ; // Size of the unsorted ...
Contents
Chapter | 1 |
Abstract Data Types and Java Classes | 35 |
Chapter 3 | 79 |
Copyright | |
34 other sections not shown
Other editions - View all
Common terms and phrases
Accessor method activated addAll addend algorithm applet arithmetic overflow array ArrayBag B-tree bag's binary search tree binary tree BTNode Celsius clone method collection class complete binary tree components computation constructor contains copy countOccurrences create current element cursor data type double number EasyReader edu.colorado.collections example expression Figure graph hash hash table head reference heap heapsort IllegalArgumentException implements Cloneable Indicates insufficient memory initial capacity input instance variables IntArrayBag integer IntLinkedBag IntNode Java Javadoc linked list Location loop manyItems manyNodes mergesort method returns node null reference number of elements OutOfMemoryError Indicates insufficient package Parameters position Postcondition Precondition priority queue private instance variables pseudocode public boolean public class public int public Object public static void public void quicksort recursive call remove return value returns true root Self-Test Exercises sequence shown specified stack statement stored String subtree super.clone target Throttle Throws vertex vertices write zero