Programming Foundations
Data Structures and Algorithms
Understand how to measure and improve code speed. Covers Big O, searching, sorting, trees and graphs, with Python throughout.
- Intermediate
- About 24 hours
- 4 modules
- 17 lessons
- Free
This course is not released yet. We publish courses one at a time, each one complete. The full syllabus is below.
What you will learn
- Measuring EfficiencyWhat Is an Algorithm?, Big O Notation, Time vs Space and more
- Searching and SortingLinear and Binary Search, Bubble and Insertion Sort, Merge Sort and more
- Recursion and TreesRecursion, Binary Trees, Binary Search Trees and more
- Graphs and BeyondGraph Basics, Breadth-First Search, Depth-First Search and more
Course syllabus
Not released yet · full syllabus below
- 1
Measuring Efficiency
4 lessons- 1What Is an Algorithm?Soon
- 2Big O NotationSoon
- 3Time vs SpaceSoon
- 4Analysing LoopsSoon
- 2
Searching and Sorting
4 lessons- 5Linear and Binary SearchSoon
- 6Bubble and Insertion SortSoon
- 7Merge SortSoon
- 8Quick SortSoon
- 3
Recursion and Trees
4 lessons- 9RecursionSoon
- 10Binary TreesSoon
- 11Binary Search TreesSoon
- 12Tree TraversalSoon
- 4
Graphs and Beyond
5 lessons- 13Graph BasicsSoon
- 14Breadth-First SearchSoon
- 15Depth-First SearchSoon
- 16Dynamic Programming BasicsSoon
- 17Hash TablesSoon