Java Software Structures: Designing and Using Data Structures
The second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms.
Results 1-3 of 5
Radix sort is discussed as an example of using queues effectively. ... Searching)
discusses the linear and binary search algorithms, as well as the algorithms for
several sorts: selection sort, insertion sort, bubble sort, quick sort, and merge sort.
Similar to search algorithms, sort algorithms generally are divided into two
categories based on efficiency: sequential sorts, which ... sorts — selection sort,
insertion sort, and bubble sort — and two logarithmic sorts — quick sort and
The bubble sort algorithm sorts a list by repeatedly comparing neighboring
elements and swapping them if necessary. > The quick sort algorithm sorts a list
by partitioning the list and then recursively sorting the two partitions. > The merge
What people are saying - Write a review
17 other sections not shown