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 14
Mergesort The most straightforward implementation of the divide-and-conquer
approach to sorting is the mergesort algorithm. Let's see how the mergesort
works with a small array. The first step divides the array into two equally sized
Mergesort — Analysis A complete analysis of mergesort's running time is beyond
the scope of this book, but we can give the final result and hint at its derivation.
First the result: Mergesort Running Time The worst-case running time, the ...
Mergesort also has a worst-case running time that is 0(n log n), whereas the
worst-case running time for quicksort is 0(n2) . That makes mergesort sound
preferable to quicksort. However, mergesort requires more storage since it
requires an ...
What people are saying - Write a review
The Phases of Software Development
Abstract Data Types and Java Classes
27 other sections not shown