Mastering Algorithms with C

Part III. Algorithms

This part of the book contains six chapters on algorithms. Chapter 12, covers various algorithms for sorting, including insertion sort, quicksort, merge sort, counting sort, and radix sort. Chapter 12 also presents binary search. Chapter 13, covers numerical methods, including algorithms for polynomial interpolation, least-squares estimation, and the solution of equations using Newton’s method. Chapter 14, presents algorithms for data compression, including Huffman coding and LZ77. Chapter 15, presents algorithms for DES and RSA encryption. Chapter 16, covers graph algorithms, including Prim’s algorithm for minimum spanning trees, Dijkstra’s algorithm for shortest paths, and an algorithm for solving the traveling-salesman problem. Chapter 17, presents geometric algorithms, including methods for testing whether line segments intersect, computing convex hulls, and computing arc lengths on spherical surfaces.