Introduction to the analysis of algorithms
Please sign in so that we can notify you about a reply
How to prove that the given algorithm does what he should do?
Key ideas of induction and invariability
Standard design methods: greedy algorithms, dynamic programming and paradigm "share and reign"
The mathematical basis of algorithms
Extended algorithms
Tasks with maximum terms
Online algorithms
Public key encryption
Solving optimization problems
The task of this book is simple: to disassemble "ideas" underlying the programs and show how to prove their correctness.
How to mathematically prove that the given algorithm does what he should do? And why is it so important?
The correctness of classic algorithms is proved: integer division, the algorithm of Euclidean, ranking, etc. In addition to traditional algorithms, such as greedy algorithms, dynamic programming algorithms and algorithms “Separate and reign”, the book also examines randomized and online algorithms. The former became universal due to the appearance of cryptography, and the latter are necessary in many areas, starting with operating systems and ending with the stock market.
The book is dotted with tasks. Most tasks are theoretical, but many require the implementation of the algorithm, the Python 3. Despite its brevity, the publication is mathematically strict for such tasks. Pre -acquaintance with discrete mathematics is desirable.
The publication is intended for university students, specialists in the field of computer science and mathematics, as well as a wide range of programmers and developers
Key ideas of induction and invariability
Standard design methods: greedy algorithms, dynamic programming and paradigm "share and reign"
The mathematical basis of algorithms
Extended algorithms
Tasks with maximum terms
Online algorithms
Public key encryption
Solving optimization problems
The task of this book is simple: to disassemble "ideas" underlying the programs and show how to prove their correctness.
How to mathematically prove that the given algorithm does what he should do? And why is it so important?
The correctness of classic algorithms is proved: integer division, the algorithm of Euclidean, ranking, etc. In addition to traditional algorithms, such as greedy algorithms, dynamic programming algorithms and algorithms “Separate and reign”, the book also examines randomized and online algorithms. The former became universal due to the appearance of cryptography, and the latter are necessary in many areas, starting with operating systems and ending with the stock market.
The book is dotted with tasks. Most tasks are theoretical, but many require the implementation of the algorithm, the Python 3. Despite its brevity, the publication is mathematically strict for such tasks. Pre -acquaintance with discrete mathematics is desirable.
The publication is intended for university students, specialists in the field of computer science and mathematics, as well as a wide range of programmers and developers
Author:
Author:Saltis Michael
Cover:
Cover:Hard
Category:
- Category:Computer & Technology
Publication language:
Publication Language:Russian
Paper:
Paper:Offset
ISBN:
ISBN:978-5-97060696-4
No reviews found