Answer the question
In order to leave comments, you need to log in
Best first book on algorithms?
Lord.
There is an intention to deepen your knowledge and start with a good book about algorithms. I have an economic education, I work in the financial sector, I actively use Excel VBA, I am looking for ways to automate my tasks and tasks in adjacent areas of work, I really enjoy this process, I have implemented several really useful things for myself and people. There is an idea to develop in this direction in parallel.
Cormen “Algorithms. Construction and analysis” and Wirth “Algorithms and data structures”.
Tell me what is better to take? To what extent are these books interchangeable, fundamental and self-sufficient (i.e. available for mastering without special training in IT)?
Answer the question
In order to leave comments, you need to log in
I vote for Kormen). Economic mathematics should be enough to master, and the rest is a matter of time and effort.
Try Wirth - the book is small and more than accessible, you can easily teach programming to high school students in specialized schools / clubs using it.
Cormen! It makes sense to skip some chapters, but this is definitely the best book. Don't let the size scare you, but it is written in a very understandable language.
We at the university read an excellent course on algorithms based on the book
I liked it very much
Kormen is too big. This is more of a reference book than a free reading book. I would recommend to start with Ivanov "Discrete Mathematics"
V. Potopakhin. "The Art of Algorithmization" www.ozon.ru/context/detail/id/5774388/
Thin and poppy book... There are half of the popular algorithms. At least after it, all other explanations of the algorithms become much clearer.
Kormen for a complete understanding requires knowledge of discrete mathematics and the basics of mathematical logic. If you skip some of the chapters, then a good "recipe" reference book. But for starters, it’s still better to read Wirth - an order of magnitude more accessible for beginners.
Wirth has several editions (editions) of the book Algorithms and Data Structures, using different languages for examples.
1985 (original 1976) - Algorithms + Data Structures = Programs (Pascal)
1989 (original 1986) - Algorithms and Data Structures (Modula-2)
2010 (in the original from 2004) - Algorithms and data structures. New version for Oberon
Which one is better to choose for reading / studying, etc. ? Is the newest version supplemented / extended in comparison with previous editions?
In electronic form Programming: typical tasks, algorithms, methods .
In a paper version, this Algorithms in Java is good .
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question