Algorithms and data processing structures

An algorithm is a sequence of commands. a set of instructions describing the procedure for achieving the result. Writing an algorithm in a programming language in the form of certain instructions (commands) that follow each other is called a program. We can say that a program is an algorithm + data structures. Commands (they are also instructions or operators) are the smallest autonomous part that executes some kind of program code.


📕 Algorithms and programs. The C++ language. Tutorial (2017)

📗 Algorithms. Construction and analysis. 3rd edition [2013, DJVU, Ru]

📙 Algorithms. Reference book with examples in C, C++, Java and Python [2017, EN, PDF]

Byrd R. - Pearls of algorithm design. Functional Approach (Functional Programming) - 2013

📔 Henry S. Warren - Algorithmic Tricks for Programmers, 2nd Edition

📒 Grok algorithms. Illustrated Guide for programmers and the Curious (2017)

📕 D. Green, D. Knuth Mathematical methods of algorithm analysis

Dasgupta S., Papadimitriou H., Vazirani U. - Algorithms

📙 J. McConnell - Analysis of algorithms. Introductory course, 2nd expanded edition

📒 Igoshin V.I. Theory of algorithms [2016]

📘 Kleinberg J. Algorithms development and application

📓 R. Laforet - Data structures and algorithms in Java, 2nd edition

📔 R. Sedgwick, K. Wayne - Algorithms in Java, 4th edition

Комментарии

Отправить комментарий

Популярные сообщения из этого блога

Computer (machine) graphics

Computer (machine) graphics is a field of activity that studies the creation, storage and processing of images using computers. Interactive computer graphics is understood as a section of computer graphics that studies the issues of dynamic control by the user of the image content, its shape, size and color on the screen using interactive interaction devices. In addition to interactive computer graphics, there are sections that study methods of working with an image on a plane, the so-called 2D graphics, and three-dimensional (3D) graphics. 1. Computer geometry and algorithms of machine graphics 2003 Nikulin 2. Computer graphics polygon. models 2001 Shikin, Boreskov 3. Computer graphics. Dynamics, realistic images 1996 Shikin, Boreskov 4. Mathematical foundations of machine graphics 2001 Rogers D., Adams J. 5. Methods and algorithms of computer graphics 2003 Polyakov, Brusentsov 6. The beginnings of computer graphics 1993 Shikin, Boreskov, Zaitsev 7. Computer graphics programming, Mode...
Далее...

Graph theory

Graph theory is a branch of discrete mathematics that studies graphs. In the most general sense, a graph is a set of points (vertices, nodes) that are connected by a set of lines (edges, arcs). Graph theory (that is, systems of lines connecting given points) is included in the curricula for beginning mathematicians because: ▪ like geometry, it has visibility; ▪ Like number theory, it is easy to explain and has complex unsolved problems; has no cumbersome mathematical apparatus ("combinatorial methods of finding the desired ordering of objects differ significantly from classical methods of analyzing the behavior of systems using equations"); ▪ has a pronounced applied character. Graph theory [2002] Distel P 📓 Graph theory, coding theory and flowcharts [1980] Cameron P., Van Lint J. 📕 Graph theory: Coverings, stacking, tournaments [1974] Alekseev, Gavrilov, Sapozhenko Graph theory and its applications [1962] Berge K. Lectures on graph theory [1990] Emelichev 📘 Graph Theory [...
Далее...