• Title Sequential and Parallel Sorting Algorithms
• Author(s) Hans Werner Lang, Thomas Niemann, etc.
• Publisher: University of Applied Sciences (2013)
• Hardcover/Paperback N/A
• eBook HTML
• Language: English
• ISBN-10: 0195086090
• ISBN-13: 978-0195086096
• Share This:  

Book Description

Varieties of sequential and parallel sorting algorithms are explained, followed by source code (in Java and C++). Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous.

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.

• N/A

• Amazon

• Algorithms and Data Structures
• Information Retrieval (IR) and Search Engines Design/Implementation
• Data Analysis and Data Mining, Big Data

• Sequential and Parallel Sorting Algorithms (Hans Werner Lang)
• The Mirror Site (1) - PDF
• Sorting and Searching Algorithms: A Cookbook (Thomas Niemann)
• Sorting Algorithms (Wikibooks)
• Efficient Algorithms for Sorting and Synchronization (Andrew Tridgell)

• Parallel Algorithms (Henri Casanova, et al)

  Focusing on algorithms for distributed-memory parallel architectures, the book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

• Average Case Analysis of Algorithms on Sequences (Szpankowski)

  It describes methods employed in average case analysis of algorithms, combining both analytical and probabilistic tools in a single volume. Illustrated through problems on words with applications to molecular biology, data compression, security, and pattern matching.

• Text Algorithms (Maxime Crochemore, et al)

  This much-needed book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. The core is the material on suffix trees and subword graphs, applications of these data structures.

• Lecture Notes on Bucket Algorithms (Luc Devroye)

  The bucket data structure is rather sensitive to the distribution of the data. In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data.

• Art Gallery Theorems and Algorithms (Joseph O'Rourke)

  This book is the most comprehensive collection of results on polygons currently available and thus earns its place as a standard text in discrete and computational geometry. It is very well written and a pleasure to read.

• Clever Algorithms: Nature-Inspired Programming Recipes

  The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.

• The Everyday Life of an Algorithm (Daniel Neyland)

  Through investigating the everyday life of the algorithm, the book opens a conversation with existing social science research that tends to focus on the power and opacity of algorithms, via unique access to the algorithm's design, development, testing, etc.