ABSTRACT
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.
