Their early joint work in algorithm design and analysis techniques contributed crucial approaches to the theoretical core of computer science that emerged during this period.

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...

By bridging culture and computation, heritage algorithms challenge the myth of ‘primitive cultures’ and forge a new understanding of science and art.