Abstract
The chapter is devoted to the methods of analysis of basic algorithms that are important for computer applications of discrete mathematics. The following algorithms are considered in detail:
-
1.
search algorithms (sequential, binary, Fibonaccian, interpolation search),
-
2.
sorting algorithms (insertion, bubble, shaker, selection, Shellsort, quicksort),
-
3.
algorithms for determining order statistics.
An idea of recursive algorithms is given.
In chapters “Concept of an Algorithm,” “Correctness of Algorithms,” and “Basic Algorithms” fragments of code are set in order to demonstrate the applicability of the studied methods in programming practice. Headings of some problems in chapter “Basic Algorithms” are in semi-bold; the above-mentioned problems are recommended to do in a computer lab.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Pierre-Simon, marquis de Laplace (1749–1827) was a French mathematician, physicist, and astronomer.
- 2.
Pierre Frédéric Sarrus (1798–1861)—French mathematician.
- 3.
Johann Carl Friedrich Gauß (1777–1855)—prominent German mathematician and astronomer.
- 4.
Donald Lewis Shell (1924–2015)—American researcher in the sphere of computer sciences.
- 5.
Vaughan Ronald Pratt (born 1944)—American researcher specializing in the sphere of informatics and computing.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Kurgalin, S., Borzunov, S. (2018). Basic Algorithms. In: The Discrete Math Workbook. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-92645-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-92645-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92644-5
Online ISBN: 978-3-319-92645-2
eBook Packages: Computer ScienceComputer Science (R0)