Advertisement

Sorting, Merging, Searching, and Partitioning

  • Ivor Horton

Abstract

This chapter describes algorithms that are loosely related to sorting and merging ranges. Two groups of these specifically provide sorting and merging capabilities. Another group provides mechanisms for partitioning a range relative to a given element value. Two further groups provide ways of finding one or more elements in a range. In this chapter You’ll learn about:

Keywords

String Class Account Number Account Object Equal Element Binary Search Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supplementary material

978-1-4842-0004-9_6_MOESM1_ESM.zip (6 kb)
Chapter 6 (zip 6 kb)

Copyright information

© Ivor Horton 2015

Authors and Affiliations

  • Ivor Horton
    • 1
  1. 1.WAUK

Personalised recommendations