Sequential and Parallel Sorting Algorithms
by H. W. Lang
Publisher: FH Flensburg 2000
Number of pages: 312
Description:
Sequential and parallel sorting algorithms explained, followed by source code. 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.
Download or read it online for free here:
Read online
(online html)
Similar books
Matters Computational: Ideas, Algorithms, Source Codeby Joerg Arndt
This is a book for a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. We use the C++ programming language for low-level algorithms.
(17916 views)
Art of Programming Contestby Ahmed Shamsul Arefin - Gyankosh Prokashoni
Textbook for an algorithm course focusing on programming as well as a programming course focusing on algorithms. The book is specially designed to train students to participate in competitions - the ACM International Collegiate Programming Contest.
(23868 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.
(7476 views)
Algorithms for Programmers: Ideas and Source Codeby 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.
(23019 views)