Treffer: Searching and Sorting.

We have quickly sketched in Chapter 4.7 the sequential and dichotomic/bisection search strategies to answer element membership queries: Does an element already belong to the data-set or not? In this chapter, we further describe the generic framework for inserting/deleting or modifying attributes of elements of a data-set. We revisit the linear sequential and logarithmic bisection searches on sets of complex data-structured elements: sets of objects. Since the bisection search requires arrays to be totally ordered, and since raw arrays of elements are very unlikely to be already sorted beforehand, we then present two methods for sorting data-sets: (1) The selection sort, which iteratively selects the current smallest element of remaining sub-arrays, and (2) The quicksort, which recursively sorts the arrays by partitioning elements. [ABSTRACT FROM AUTHOR]

Copyright of Concise & Practical Introduction to Programming Algorithms in Java is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)