درباره کتاب مقدمه ای بر الگوریتم ها
Omid
Book: Introduction to Algorithms
Authors: Cormen, Leiserson, Rivest, Stein (C L R S)
I prefer to say these short sentences in English, because this Gmail
editor doesn't support for r2l languages such as Persian.
This book contains 8 chapters which are mostly important topics for
Algorithm students and is counted as the best reference for the course
of Algorithm Design and Analysis.
1 Foundation: this chapters starts algorithms and instances two
algorithm which can be very useful for learning coding and analysis.
you can code this algorithms.
2 Sorting and Order Statistics: this chapter instances most popular
algorithms for sorting a set of data stored in an array, and also
analyse, implement and compares these algorithms. this chapter looks
to be very useful for ACM students although there are several
implementd functions in programming languages. it is also a good
practice to code all the algorithms and practices.
3 Data structures: this chapter is also useful for getting involved
with data structures. explained subjects in this chapter are also
implemented and easy to use in every programming language, but some
applications are explained here.
4 Advanced design and Analysis techniques: i don't suggest begginer
students to study this chapter before handling their own codes. but
this chapter is very very important for ACM contribution. maybe you
would be better to study this chapter after a few months of coding.
5 Advanced data structures: this chapter is very important but you
also study in DT. only examples are important here.
6 Graph Algorithms: look at this chapter as chapter 4. this chapter is
necessary but it would be better that you study after some coding
experiences.
7 Selected topics: this chapter is also very interesting, you can use
these ex(my x key in keyboard spout)amples for improving your coding
style.
8 Mathematical background: I think this chapter has already been
studied by you, but take a look at it.