tailieunhanh - Thuật toán Algorithms (Phần 2)

Tham khảo tài liệu 'thuật toán algorithms (phần 2)', khoa học tự nhiên, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | Introduction 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 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 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. We ll review some of this material but within the context of their use to solve particular problems. Some elementary acquaintance with machine organization and computer architecture is also assumed. A few of the applications areas that we ll deal with will require knowledge of elementary calculus. We ll also be using some very basic material involving linear algebra geometry and discrete mathematics but previous knowledge of these topics is not necessary. 4 INTRODUCTION This book is divided into forty chapters which are organized into seven