Algorithms: Construction and Analysis (Introduction to Algorithms)
I bought this brick by Corman, Lazerson and Rivest back in the day. 2002 I thought I could be a master of algorithms. This was the first edition of the book with a white cover and then there were three co-authors. I enjoyed studying this book at the time, but in my first year at university, I didn’t have a personal computer, so I had to write a pseudocode on a piece of paper and wander around in my head. Such a scheme of work did not help much in the study of computer science, but the basics seemed to catch then. (At the same time, I realized that in this area I miss the stars from the sky:) Otherwise, I could have done it without a computer.).
And when I went to work in my third year, there was no time and desire to work on algorithms - I was busy learning the languages and tools that helped me solve practical problems in the field of web development.
Many years have passed and now you can go back to the book, and solve algorithmic problems not in your head, but on leetcode:)
The structure of the book is quite logical and consists of the following parts:
- Mathematical bases of algorithm analysis speed of function growth (notation(n)), recurrent ratios, sets, combinatorics and probability
- Sorting and ordinal statistics - sorting by heap, quick sort, medians and ordinal statistics
- Data structures - stacks, queues, linked lists, hash tables, trees
- Methods of construction and analysis of algorithms Dynamic programming, greedy algorithms
- More complex data structures b-tree, binomial heaps, phyobanaccia heaps, non-intersecting set systems
- Graph algorithms - search in width and depth, minimum covering trees, shortest paths, maximum flow
- Additional chapters Matrices, fast Fourier transform, NP-completeness and more
In general, a fundamental book with cool themes and intimidating dimensions:) By the way, you should order. fourth editionWhat if I already have one?
#Software #Algorithm #Engineering #SelfDevelopment