Algorithms (Алгоритмы) - download pdf or read online

By Robert Sedgewick

ISBN-10: 0201066726

ISBN-13: 9780201066722

Из предисловия к книге
"...The publication involves 40 chapters that are grouped into seven significant components: mathematical algorithms, sorting, looking, string processing, geometric algorithms, graph algorithms and complicated issues. a massive target within the improvement of this booklet has been to assemble the basic equipment from those diversified components, so one can offer entry to the simplest tools that we all know for fixing difficulties by means of desktop for as many folks as possible."

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

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

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

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

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

Show description

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

Similar algorithms and data structures books

Michael McMillan's Data Structures and Algorithms Using Visual Basic.NET PDF

During this instructional for VisualBasic. web programmers, facts buildings and algorithms are awarded as problem-solving instruments that don't require translations from C++ or Java. McMillan (computer info platforms, Pulaski Technical university) explains arrays, ArrayLists, associated lists, hash tables, dictionaries, bushes, graphs, and sorting and looking with object-oriented representations.

Handbook of Bioinspired Algorithms and Applications by Stephan Olariu, Albert Y. Zomaya PDF

The mystique of biologically encouraged (or bioinspired) paradigms is their skill to explain and clear up complicated relationships from intrinsically extremely simple preliminary stipulations and with very little wisdom of the quest area. Edited by way of popular, well-respected researchers, the instruction manual of Bioinspired Algorithms and functions unearths the connections among bioinspired options and the improvement of strategies to difficulties that come up in diversified challenge domain names.

Fuzzy logic-based algorithms for video de-interlacing by Piedad Brox PDF

The ‘Fuzzy good judgment’ examine workforce of the Microelectronics Institute of Seville consists of researchers who've been doing examine on fuzzy common sense because the starting of the Nineties. often, this learn has been desirous about the microelectronic layout of fuzzy logic-based platforms utilizing implementation options which diversity from ASICs to FPGAs and DSPs.

Get Advanced Topics in Database Research, Vol. 1 PDF

Complex issues in Database learn beneficial properties the most recent, state-of-the-art learn findings facing all points of database administration, platforms research and layout and software program engineering. This publication presents details that's instrumental within the development and improvement of conception and perform concerning info expertise and administration of data assets.

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

Example text

Give a counterexample to the assertion that the user of an abstract data structure need not know what representation is being used. 3. Random Numbers Our next set of algorithms will bie methods for using a computer to generate random numbers. We will find many uses for random numbers later on; let’s begin by trying to get a better idea of exactly what they are. Often, in conversation, people use the term random when they really mean arbitrary. When one asks for an trrbitrary number, one is saying that one doesn’t really care what number one gets: almost any number will do.

10. Give the representation that you would use for programs to add and multiply multivariate polynomials such as xy2z + 31~~~7~~2~~ + w. Give the single most important reason for choosing this representation. 5. ental scientific computations is the solution of systems of simultaneous equations. The basic algorithm for solving systems of equations, Gaussian elimination, is relatively simple and has changed little in the 150 years since it was invented. This algorithm has come to be well understood, especially in the past twenty years, so that it can be used with some confidence that it will efficiently produce accurate results.

But certainly, this overhead makes Strassen’s method less efficient than the standard method for small matrices. 41. This improvement is hard to notice except for very large N. For example, N would have to be more than a million for Strassen’s method to use four times as few multiplications as the standard method, even though the overhead per multiplication is likely to be four times as large. Thus the algorithm is a theoretical, not practical, contribution. This illustrates a general tradeoff which appears in all applications (though the effect, is not always so dramatic): simple algorithms work best for small problems, but sophisticated algorithms can reap tremendous savings for large problems.

Download PDF sample

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


by William
4.3

Rated 4.71 of 5 – based on 40 votes