Computing Algorithms

Description

The real-world performance of any software system depends on the algorithms used and the efficiency of their implementation. The ability to select algorithms appropriate to solving particular problems, based on understanding the range of algorithms that address well-defined problems, analyzing their complexity and performance, and their suitability in particular contexts and implementing them is critical for building effective software. A number of general algorithmic strategies are presented including brute force, heuristics, greedy, recursive backtracking and divide and conquer. Common algorithms pertaining to searching, sorting, binary trees, graphs, and string / expression parsing are also discussed. Also, both in-memory and file data structures and their interrelationship with specific algorithms are reviewed.