11
Sorting
Objectives
The concept and implementation of standard sorting algorithms—
bubblesort, heapsort, insertionsort, mergesort, and quicksort
Analysis of the worst-case running times of the standard sorting algorithms
Analysis of the average-case running times of the standard sorting algo-
rithms
The difference between worst-case and average-case running times of algo-
rithms and how to perform an average-case analysis
Practical considerations of sorting: auxiliary space, disk, the extent to which
the input data is already sorted, multilevel sorting, and stability
The lower bound on sorting by comparisons
* Sorting on a distributed memory ...
Get Data Structures Using Java now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
