Sorting and Searching Algorithms: A Cookbook
by Thomas Niemann
2008
Number of pages: 36
Description:
This is a collection of algorithms for sorting and searching, with brief and intuitive descriptions. It is assumed that you know C, and that you are familiar with concepts such as arrays and pointers. The text presents several sorting algorithms, techniques for implementing dictionaries, structures that allow efficient search, insert, and delete operations, algorithms that sort data and implement dictionaries for very large files.
Download or read it online for free here:
Download link
(150KB, PDF)
Similar books
Sequential and Parallel Sorting Algorithms
by H. W. Lang - FH Flensburg
From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest. Explanations are followed by source code.
(21334 views)
by H. W. Lang - FH Flensburg
From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest. Explanations are followed by source code.
(21334 views)
Algorithms for Programmers: Ideas and Source Code
by Jorg Arndt
Aimed to programmers who are interested in the selected algorithms and those who want to create optimized code. It covers low level algorithms, combinatorial generation, fast orthogonal transforms, fast arithmetic, and algorithms for finite fields.
(22928 views)
by Jorg Arndt
Aimed to programmers who are interested in the selected algorithms and those who want to create optimized code. It covers low level algorithms, combinatorial generation, fast orthogonal transforms, fast arithmetic, and algorithms for finite fields.
(22928 views)
Algorithms Notes for Professionals
- Goalkicker.com
Contents: Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
(7381 views)
- Goalkicker.com
Contents: Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
(7381 views)
Text Algorithms
by M. Crochemore, W. Rytter - Oxford University Press
This book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It will serve both as a textbook for courses on algorithm design and as a reference for professionals.
(17904 views)
by M. Crochemore, W. Rytter - Oxford University Press
This book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It will serve both as a textbook for courses on algorithm design and as a reference for professionals.
(17904 views)