Arndt Jorg. Algorithms for programmers. Ideas and source code
Файл формата
zip
размером 1,07 МБ
содержит документ формата
pdf
Добавлен пользователем Админ, дата добавления неизвестна
Описание отредактировано
The Fourier transform. The discrete Fourier transform (DFT). Radix 2 FFT algorithms. Decimation in time (DIT) FFT. Decimation in frequency (DIF) FFT. Using higher radix algorithms. Higher radix DIT and DIF algorithms. Split radix Fourier transforms (SRFT). Multidimensional FTs. The matrix Fourier algorithm (MFA). Eigenvectors of the Fourier transform. Convolutions. Weighted Fourier transforms. The z-transform (ZT). The Hartley transform (HT). Radix 2 FHT algorithms. Discrete cosine transform (DCT) by HT. Discrete sine transform (DST) by DCT. Number theoretic transforms (NTTs). The Chinese Remainder Theorem (CRT). The Reed-Muller transform (RMT). Permutations. The radix permutation. In-place matrix transposition. Revbin permutation vs. transposition. The ZIP permutation. The reversed ZIP-permutation. The XOR permutation. The Gray code permutation. The reversed Gray code permutation. The green code permutation. The reversed green code permutation. Factorizing permutations. General permutations. Trivia. Hilbert’s space-filling curve. Searching. Index sorting. Pointer sorting. Sorting by a supplied comparison function. Unique. Heap-sort. Data structures. Stack (LIFO). Ring buffer. Queue (FIFO). Deque (double-ended queue). Heap and priority queue. Bit-array. Resizable array. Ordered resizable array. Resizable set. Selected combinatorial algorithms. Combinations in lexicographic order. Combinations in co-lexicographic order. Combinations in minimal-change order. Combinations in alternative minimal-change order. Offline functions: funcemu. Parenthesis. Partitions. Compositions. Compositions in lexicographic order. Compositions from combinations. Compositions in minimal-change order. Numbers in lexicographic order. Subsets in lexicographic order. Subsets in minimal-change order. Subsets ordered by number of elements. Subsets ordered with shift register sequences/ Shift register sequences. Feedback carry shift register (FCSR). Linear hybrid cellular automata (LHCA). Necklaces. Division. Square root extraction. Cube root extraction. Iterations for the inverse n-th root. Re-orthogonalization of matrices. Goldschmidt’s algorithm. Householder’s formula. The AGM. Elliptic K. Elliptic E. Chebyshev polynomials and recurrences. Continued fractions. Hypergeometric functions. CORDIC algorithms.
Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
Springer, 2010. — 978 p. This is a book for the computationalist, whether a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. Where necessary the underlying ideas are explained and the algorithms are given formally. It is assumed that the reader is able to understand the given...
Kenneth A. Berman, Jerome L. Paul, Course Technology, 2005, pages: 996 Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers,...
3rd edition. — The MIT Press, 2009. — 1312 p. — ISBN-13 978-0262033848. Solutions for a select set of exercises and problems for Introduction to Algorithms, Third Edition . Selected Solutions for Chapter 2: Getting Started Selected Solutions for Chapter 3: Growth of Functions Selected Solutions for Chapter 4: Divide-and-Conquer Selected Solutions for Chapter 5: Probabilistic...
Cambridge University Press, 2007. — 1262 p. Authors: William H. Press - Raymer Chair in Computer Sciences and Integrative Biology The University of Texas at Austin Saul A. Teukolsky - Hans A. Bethe Professor of Physics and Astrophysics Cornell University William T. Vetterling - Research Fellow and Director of Image Science ZINK Imaging, LLC Brian P. Flannery - Science, Strategy...
4th Edition. — Addison-Wesley, 2011. — 969 p. — ISBN: 032157351X. Essential Information about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph...