Algorithms Basics

This book covers search algorithms (linear search, binary search); sorting algorithms (insertion sort, merge sort); the concept of divide-and-conquer algorithms and particular instances of them; the concept of dynamic programming algorithms and particular instances of them; the concept of greedy algorithms and particular instances of them; some advanced data structures such as heaps, binary search trees, and set partitions; some algorithms in computational geometry (line segment intersections, convex hull computations), and string matching.

The algorithms are mostly explained at an intuitive level. Running time analyses are also included.