
OrderedCollection
Chapter 30
Sorted Array Data Structure
AbstractCollection<E> implements Collection<E>
↑
SortedArray<E> implements OrderedCollection<E>
Uses: Array (Chapter 11), DynamicArray (Chapter 13)
Used By: B-Tree (Chapter 36), B+-Tree (Chapter 37), TaggedSortedArray (Section 49.9.2)
Strengths: Fastest search time, as compared to other ordered collection data structures, and also
very space efficient. In addition, it provides constant time access to the element in the collection
at rank r. Given n elements, a sorted array can be created in O(n log n) time by using a sorting
algorithm.
Weaknesses: Linear worst-case time to insert or remove elements, ...