Simple Examples

  • Derrick G. Kourie
  • Bruce W. Watson


In this chapter, a number of fairly elementary algorithms are developed. They are, namely: linear search; finding the maximal element in an array; a version of binary search; a simple pattern matching algorithm; raising a number to a specific integer power; and finding the integer approximation of a logarithm to the base 2.


Binary Search Sequential Composition Select Statement Linear Search Assignment Rule 
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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Derrick G. Kourie
    • 1
  • Bruce W. Watson
    • 2
  1. 1.Department of Computer ScienceUniversity of PretoriaPretoriaSouth Africa
  2. 2.FASTAR Group, Information ScienceStellenbosch UniversityStellenboschSouth Africa

Personalised recommendations