Advertisement

Algorithm Design Topics

  • Antti LaaksonenEmail author
Chapter
  • 193k Downloads
Part of the Undergraduate Topics in Computer Science book series (UTICS)

Abstract

This chapter discusses a selection of algorithm design topics. Section 8.1 focuses on bit-parallel algorithms that use bit operations to efficiently process data. Typically, we can replace a for loop with bit operations, which may remarkably improve the running time of the algorithm. Section 8.2 presents the amortized analysis technique, which can be used to estimate the time needed for a sequence of operations in an algorithm. Using the technique, we can analyze algorithms for determining nearest smaller elements and sliding window minima. Section 8.3 discusses ternary search and other techniques for efficiently calculating minimum values of certain functions.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of HelsinkiHelsinkiFinland

Personalised recommendations