When a program attempts to search a data structure for a particular item, it uses an algorithm. An algorithm is a process, defined in code, for carrying out a specific task.

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 ...

Specialization: Data Science Foundations: Data Structures and Algorithms Instructor: Sriram Sankaranarayanan, Assistant Professor Prior knowledge needed: Mathematical Background: We expect that the ...

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.