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

By Robert Sedgewick

ISBN-10: 0201066726

ISBN-13: 9780201066722

Из предисловия к книге
"...The e-book involves 40 chapters that are grouped into seven significant components: mathematical algorithms, sorting, looking out, string processing, geometric algorithms, graph algorithms and complex subject matters. an immense objective within the improvement of this ebook has been to assemble the elemental tools from those varied parts, so as to supply entry to the simplest equipment that we all know for fixing difficulties by means of computing device for as many of us as possible."

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

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

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

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

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

Show description

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

Best algorithms and data structures books

Tools and Algorithms for the Construction and Analysis of - download pdf or read online

This publication offers 12 revised refereed papers chosen because the top from 32 submissions for the 1st foreign Workshop on instruments and Algorithms for the development and research of structures, TACAS '95, held in Aarhus, Denmark, in may possibly 1995. The workshop introduced jointly forty six researchers drawn to the improvement and alertness of instruments and algorithms for specification, verification, research, and development of allotted structures.

Image reconstruction by OPED algorithm with averaging by Xu Y., Tischenko O., Hoeschen C. PDF

OPED is a brand new photograph reconstruction set of rules in accordance with orthogonal polynomial enlargement at the disk. We express that the vital of the approximation functionality in OPED will be given explicitly and evaluated successfully. hence, the reconstructed snapshot over a pixel should be successfully represented by way of its standard over the pixel, rather than by way of its worth at a unmarried aspect within the pixel, that could aid to lessen the aliasing brought on by below sampling.

Parameterized Algorithms by Marek Cygan, Fedor V. Fomin, Lukasz Kowalik PDF

This complete textbook provides a fresh and coherent account of such a lot basic instruments and strategies in Parameterized Algorithms and is a self-contained consultant to the world. The publication covers a few of the contemporary advancements of the sphere, together with software of significant separators, branching in line with linear programming, minimize & count number to acquire swifter algorithms on tree decompositions, algorithms in response to consultant households of matroids, and use of the robust Exponential Time speculation.

Additional resources for Algorithms (Алгоритмы)

Sample text

Polynomials Suppose that we wish to write a program that adds two polynomials: we would 23 CJUJ’TER 2 24 like it to perform calculations like (1+ 2x - 3x3) + (2 -x) = 3 + x - 3x3. In general, suppose we wish our program to be able to compute r(x) = p(x) + q(x), where p and q are polynomials with N coefficients. maxN] of real; N, i: integer; begin readln (N) ; for i:=O to N-l do read(p[i]); for i:=O to N-l do read(q[i]); for i:=O to N-J do r[i] :=p[i]+q[i]; for i:=O to N-l do write(r[i]); wri teln end.

The parenthesization P(X) = x(x(x(x + 3) - 6) + 2) + 1 makes the order of computation obvious: Y:=PN; for i:=N-I downto 0 do y:=x*y+p[i]; This program (and the others in this section) assume the array representation for polynomials that we discussed in Chapter 2. A more complicated problem is to evaluate a given polynomial at many different points. Different algorithms are appropriate depending on how many evaluations are to be done and whether or not they are to be done simultaneously. If a very large number of evaluations is to be done, it may be worthwhile to do some “precomputing” which can slightly reduce the cost for later evaluations.

O; for k:=iO to N-l do t:=t+p[i, k]*q[k, j]; r[i, j]:=t end ; Each of the N2 elements in the result matrix is computed with N multiplications, so about N3 operations are required to multiply two N by N matrices together. ) As with polynomials, sparse matrices (those with many zero elements) can be processed in a much more efficient manner using a linked list representation. To keep the two-dimensional structure intact, each nonzero matrix element is represented by a list node containing ,a value and two links: one pointing to the next nonzero element in the same row and the other pointing to the next nonzero element in the same column.

Download PDF sample

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

by Steven

Rated 4.63 of 5 – based on 12 votes