Basic data structures: Heaps, and Binary Search Trees. Algorithm Design Approaches: Divide and Conquer including analysis using recurrences Greedy Algorithms Dynamic Programming Algorithms Algorithms ...

This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It ...

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

We live in the era of big data. The huge volume of information we generate daily has major applications in various fields of science and technology, economy and management. For example, more and ...

Basic toolkit for the design and analysis of algorithms: Running time, Recurrence relations, Big-O notation, Correctness, Finite induction, Loop invariants. Tour of the most important data structures, ...