Binary Search

  • Thomas Seidl
  • Jost Enderle

Abstract

This chapter starts with a quick search strategy called binary search. This strategy assumes that the set of objects in which we will search is already sorted. The authors explain sequential search, binary search, and recursion – a recursive function is a function that is defined by itself or that calls itself.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thomas Seidl
    • 1
  • Jost Enderle
    • 1
  1. 1.RWTH Aachen UniversityAachenGermany

Personalised recommendations