Аннотация
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.
![Automate the Boring Stuff with Python [Practical Programming for Total Beginners]](https://www.rulit.me/data/programs/images/automate-the-boring-stuff-with-python-practical-programming_570900.jpg "If you’ve ever spent hours renaming files or updating hundreds of spreadsheet cells, you know how tedious tasks like these can be. But what if you could have your computer do them for you?
In Automate the Boring Stuff with Python, you’ll learn how to use Python to write programs that do in...")
Комментарии к книге "Introducing algorithms in C"