Swipe to navigate through the chapters of this book
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:
search algorithms (sequential, binary, Fibonaccian, interpolation search),
sorting algorithms (insertion, bubble, shaker, selection, Shellsort, quicksort),
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.
Please log in to get access to this content
To get access to this content you need the following product:
Pierre-Simon, marquis de Laplace (1749–1827) was a French mathematician, physicist, and astronomer.
Pierre Frédéric Sarrus (1798–1861)—French mathematician.
Johann Carl Friedrich Gauß (1777–1855)—prominent German mathematician and astronomer.
Donald Lewis Shell (1924–2015)—American researcher in the sphere of computer sciences.
Vaughan Ronald Pratt (born 1944)—American researcher specializing in the sphere of informatics and computing.
- Basic Algorithms
- Springer International Publishing
- Sequence number
- Chapter number
- Chapter 12