Algorithms

This book is to examine the most important algorithms in use on
today's computers and to teach the basic techniques with the increasing number
who was interested in computer users becoming increasingly serious. It is appropriate
for use as a textbook for a course Monday, Tuesday or Wednesday in the computer
Science: After students have had some programming skills and familiarity
computer system, but before they have advanced specialized courses
field of computer science or computer applications. In addition, the book
may be useful as a reference for those already familiar with
material, as it contains some implementations of computer useful
algorithms.
The book consists of forty chapters which are grouped into seven major
parts: mathematical algorithms, sorting, searching, string processing, geometric
algorithms, graph algorithms and other advanced topics. An important goal in
development of this book is to bring together the basic method
from diverse areas, to provide access to the best method
we know to solve problems with computers for as many people as possible.
Treatment of searching, sorting and processing chain (possibly
not included in other courses) is somewhat more complete than treatment
the mathematical algorithms (can be covered more in depth
applied mathematics or engineering courses), or graph and geometric algorithms
(May be covered further in advanced computer science