Algorithms : پنجشنبه : 19 فروردين 1389 The objective of this book is to study a broad variety of important and useful algorithms: methods for solving problems which are suited for computer implementation. We’ll deal with many different areas of application, always trying to concentrate on “fundamental” algorithms which are important to know and interesting to stu.dy. Because of the large number of areas and algorithms to be covered, we won’t have room to study many of the methods in great depth. However, we will try to spend enough time on each algorithm to understand its essential characteristics and to respect its subtleties. In short, our goal is to learn a large number of the most important algorithms used on computers today, well enough to be able to use and appreciate them. To learn an algorithm well, one must implement it. Accordingly, the best strategy for understanding the programs presented in this book is to implement and test them, experiment with variants, and try them out on real problems. We will use the Pascal programming language to discuss and implement most of the algorithms; since, however, we use a relatively small subset of the language, our programs are easily translatable to most modern programming languages. Readers of this book are expected to have at least a year’s experience in programming in high- and low-level languages. Also, they should have some familiarity with elementary algorithms on simple data structures such as arrays, stacks, queues, and trees
| تعداد صفحات / حجم | 5.40MB / 559 | | پسوند فایل | Adob Acrobat Reader -- PDF
| | سرعت دانلود با ADSL 128Kbps | 3 دقیقه | پنجشنبه : 19 فروردين 1389 www.itdevelopteam.com | 