Foundations of Algorithms

University of Melbourne | 2022s1

Algorithms are Fun!

Class and Website History

Week 1 Motivation
Week 2 C
Week 3 Functions
Week 4 Memory
Week 5 Analysis
Week 6 Quicksort
Week 7 Strings
Week 8 Data Structures
Week 9 Linked Lists
Week 10 File I/O
Week 11 Number Representation
Week 12 Wrap Up

Tools

Info

Programming in C

Week 10 File I/O

Material Covered: Binary Search Trees and Files
Reading: Chapter 11 of PPSAA
Book Slides: lec08.pdf
Lecture Slides:

Function pointers (Available to enrolled students only)

Function pointers (cont.) and BST code (Available to enrolled students only)

Using the BST package and files (Available to enrolled students only)

Most course content © University of Melbourne, (CRICOS: 00116K ABN: 84 002 705 224)