Download e-book for kindle: Algorithms (Алгоритмы) by Robert Sedgewick

By Robert Sedgewick

ISBN-10: 0201066726

ISBN-13: 9780201066722

Из предисловия к книге
"...The booklet contains 40 chapters that are grouped into seven significant components: mathematical algorithms, sorting, looking, string processing, geometric algorithms, graph algorithms and complex subject matters. an immense aim within the improvement of this ebook has been to collect the basic equipment from those diversified components, in an effort to offer entry to the easiest equipment that we all know for fixing difficulties through desktop for as many of us as possible."

Некоторое время назад на сайте были опубликованы первый и второй тома "Фундаментальных алгоритмов на С++" Роберта Седжвика. Книга Algorithms - одна из ранних публикаций (1983 год) этого автора, на русский язык она не переводилась.

Книга рассчитана на тех, кто уже немного знаком с основами программирования (скорее студентов, нежели школьников), фрагменты программ приведены на языке Pascal, в конце каждой главы имеются упражнения.

Алгоритмы описываются весьма кратко и достаточно простым языком (простота касается и английского языка - чтение книги вряд ли будет более трудным, чем чтение справочной информации в современных системах программирования). Представляется удобным то, что большое количество популярных алгоритмов
собраны под одной обложкой. Это позволяет использовать книгу и в качестве справочника.

Конечно, работу Седжвика трудно сравнивать по фундаментальности и строгости с замечательной книгой "Алгоритмы. Построение и анализ" Кормена, Лейзерсона, Ривеста и Штайна, но знакомство с первой может оказаться полезным при изучении второй.

Скан не мой, был когда-то найден в сети. Как уже говорилось, качество его умеренно хорошее: в некоторых формулах (реже в программах) встречаются ошибки распознавания. Однако в большинстве случаев правильный символ может быть легко "восстановлен".

Show description

Read Online or Download Algorithms (Алгоритмы) PDF

Best algorithms and data structures books

Read e-book online The design of innovation: lessons from and for competent PDF

The layout of Innovation illustrates tips to layout and enforce efficient genetic algorithms-genetic algorithms that clear up challenging difficulties quick, reliably, and accurately-and how the discovery of efficient genetic algorithms quantities to the production of a good computational concept of human innovation.

Flexible Pattern Matching in Strings Practical On-line - download pdf or read online

Fresh years have witnessed a dramatic elevate of curiosity in refined string matching difficulties, specifically in info retrieval and computational biology. This e-book offers a realistic method of string matching difficulties, concentrating on the algorithms and implementations that practice top in perform.

Download PDF by Christian Laurence: Lewis Basicity and Affinity Scales: Data and Measurement

The Lewis thought of acids and bases is mentioned in each common, natural and inorganic chemistry textbook. this is often frequently only a descriptive remedy, because it isn't attainable to plot a unmarried numerical scale appropriate for all events. despite the fact that quantitative Lewis acid-base chemistry might be built through compiling reaction-specific basicity scales that are utilized in particular branches of chemistry and biochemistry.

Extra info for Algorithms (Алгоритмы)

Example text

To convert a polynomial from the form described by Lagrange’s formula to our standard coefficient representation is not at all straightforward. At least N2 operations seem to be required, since there are N terms in the sum, each consisting of a product with N factors. Actually, it takes some cleverness to achieve a quadratic algorithm, since the factors are not just numbers, but polynomials of degree N. On the other hand, each term is very similar to the previous one. The reader might be interested to discover how to take advantage of this to achieve a quadratic algorithm.

If this doesn’t happen in a sequence of pseudo-random numbers, then there is something wrong with the random number generator. Many sophisticated tests based on specific observations like this have been devised for random number generators, testing whether a long sequence of pseudo random numbers has some property that random numbers would. The random number generators that we will study do very well in such tests. We have been (and will be) talking exclusively about uniform random numbers, with each value equally likely.

Though 53 PoLYNoMIALs such relationships can be challenging to solve precisely, they are often easy to solve for some particular values of N to get solutions which give reasonable estimates for all values of N. Our purpo,se in this discussion is to gain some intuitive feeling for how divide-and-conquer algorithms achieve efficiency, not to do detailed analysis of the algorithms. Indeed, the particular recurrences that we’ve just solved are sufficient to describe the performance of most of the algorithms that we’ll be studying, and we’ll simply be referring back to them.

Download PDF sample

Algorithms (Алгоритмы) by Robert Sedgewick

by Jason

Rated 4.82 of 5 – based on 48 votes