Аннотация
Chapter 1 introduces data types (simple and structured), and Chapter 2 defines the algorithms and flowcharts with graphical and textual explanations. We’ll look at simple and complex standard algorithms, as well as their flowcharts. Everything is integrated with explanations, schemas, and tables to show the step-by-step evolution of the algorithms.
The main analyzed algorithms are the following: the sum of three orn numbers in a loop, the decimal to binary conversion, the maximum and minimum search, the linear/sequential search, the binary search, the bubble sort, the selection sort, the merging of two sorted arrays, and the reading chars from file algorithm, stack management, and the recursive algorithm (factorial and Fibonacci sequence).
The last chapter is devoted to the introduction of the C language and the implementation of code related to the algorithms in this book. Many C programs are explained.
![Библия Delphi [3-е издание]](https://www.rulit.me/data/programs/images/bibliya-delphi-3-e-izdanie_485912.jpg "Книга посвящена программированию на языке Delphi от самых основ до примеров построения конкретных приложений. Подробно описывается логика выполнения каждого...")
![Agile Testing: A Practical Guide for Testers and Agile Teams [calibre 2.56.0]](https://www.rulit.me/data/programs/images/agile-testing-a-practical-guide-for-testers-and-agile-teams_566869.jpg "Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed with initial capital letters or in all capitals.
The...")
Комментарии к книге "Introducing algorithms in C"