Get Algorithms (Алгоритмы) PDF

By Robert Sedgewick

ISBN-10: 0201066726

ISBN-13: 9780201066722

Из предисловия к книге
"...The publication comprises 40 chapters that are grouped into seven significant elements: mathematical algorithms, sorting, looking out, string processing, geometric algorithms, graph algorithms and complex issues. a huge target within the improvement of this ebook has been to compile the basic equipment from those different parts, that allows you to offer entry to the easiest tools that we all know for fixing difficulties by means of laptop for as many folks as possible."

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

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

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

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

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

Show description

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

Best algorithms and data structures books

Download e-book for kindle: Handbook of algorithms and data structures: in Pascal and C by Gaston H. Gonnet, Gaston Gonnet, Ricardo Baeza-Yates, R.

Either this ebook and the previous (smaller) variation have earned their position on my reference shelf. extra modern than Knuth's second variation and protecting a lot broader territory than (for instance) Samet's D&A of Spatial information constructions, i have chanced on a couple of algorithms and information constructions during this textual content which were at once appropriate to my paintings as a structures programmer.

Download e-book for iPad: Functional Data Analysis (Springer Series in Statistics) by Jim Ramsay, Giles Hooker

This is often the second one version of a hugely capable ebook which has bought approximately 3000 copies around the globe due to the fact its ebook in 1997. Many chapters should be rewritten and improved as a result of loads of development in those parts because the booklet of the 1st version. Bernard Silverman is the writer of 2 different books, each one of which has lifetime revenues of greater than 4000 copies.

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

Example text

This work gives us some guidance in choosing the constants b and m. Some “common-sense” principles apply, but in this case common sense isn’t enough to ensure good random numbers. First, m should be large: it can be the computer word size, as mentioned above, but it needn’t be quite that large if that’s inconvenient (see the implementation below). It will normally be convenient to make m a power of 10 or 2. Second, b shouldn’t be too large or too small: a safe choice is to use a number with one digit less than m.

We won’t go into the details here, but we can sketch the method, since it is very similar to the polynomial multiplication method that we have just studied. The straightforward method for multiplying two N-by-N matrices requires N3 scalar multiplications, since each of the N2 elements in the product matrix is obtained by N multiplications. Strassen’s method is to divide the size of the problem in half; this corresponds to dividing each of the matrice;s into quarters, each N/2 by N/2. The remaining problem is equivalent to multiplying 2-by-2 matrices.

10000)(1+ 2,lOOOO) = 1+ 3~10000 + 2~20000, even though the input involves only four c’oefficients and the output only three. An alternate way to represent a pol:ynomial is to use a linked list. This involves storing items in noncontiguous memory locations, with each item containing the address of the next. The Pascal mechanisms for linked lists are somewhat more complicated than for arrays. For example, the following program computes the sum of two polynomials using a linked list representation (the bodies of the readlist and add functions and the writelist procedure are given in the text following): program polyadd(input, output); type link = mode; node = record c: real; next: link end ; var N: integer; a: link; function readlist(N: integer) : link; procedure writelist(r: link); function add(p, q: link) : link; begin readln(N); new(z); writelist(add(readlist(N), readlist(N end.

Download PDF sample

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

by Kenneth

Rated 4.30 of 5 – based on 15 votes