Velamuvi AIAcademy
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. 1

    Measuring Efficiency

    4 lessons
    1. 1What Is an Algorithm?Soon
    2. 2Big O NotationSoon
    3. 3Time vs SpaceSoon
    4. 4Analysing LoopsSoon
  2. 2

    Searching and Sorting

    4 lessons
    1. 5Linear and Binary SearchSoon
    2. 6Bubble and Insertion SortSoon
    3. 7Merge SortSoon
    4. 8Quick SortSoon
  3. 3

    Recursion and Trees

    4 lessons
    1. 9RecursionSoon
    2. 10Binary TreesSoon
    3. 11Binary Search TreesSoon
    4. 12Tree TraversalSoon
  4. 4

    Graphs and Beyond

    5 lessons
    1. 13Graph BasicsSoon
    2. 14Breadth-First SearchSoon
    3. 15Depth-First SearchSoon
    4. 16Dynamic Programming BasicsSoon
    5. 17Hash TablesSoon

Recommended next