Chapter 2: Data Structures & Algorithms¶

Choose the right data structures and analyze algorithm complexity for AI workloads.

Metadata¶

Learning Objectives¶

• Choose appropriate data structures for problems
• Understand and analyze algorithm complexity (Big O)
• Implement common algorithms efficiently
• Work with arrays, stacks, queues, trees, and graphs
• Apply sorting and searching algorithms
• Use recursion and dynamic programming basics

What's Included¶

Notebooks¶

Scripts¶

• Production-ready implementations of core data structures and algorithms

Exercises¶

• 5 exercises with solutions (in solutions/ branch)

SVG Diagrams¶

• 3 visual diagrams for structures and algorithm flow

Read Online¶

You can read the full chapter content right here on the website:

• 02.1 Introduction -- Arrays, Big O notation, linear/binary search, two-pointer
• 02.2 Intermediate -- Stacks, queues, hash tables, merge sort, quicksort
• 02.3 Advanced -- Trees, graphs, BFS/DFS, dynamic programming, search index capstone

Or try the code in the Playground.

How to Use This Chapter¶

1. Clone and install dependencies

git clone https://github.com/luigipascal/berta-chapters.git
cd berta-chapters
pip install -r requirements.txt

2. Navigate to the chapter

cd chapters/chapter-02-data-structures

3. Launch Jupyter

jupyter notebook notebooks/01_introduction.ipynb

Created by Luigi Pascal Rondanini | Generated by Berta AI