YSC2229: Introductory Data Structures and Algorithms
1. Software Prerequisites
2. OCaml Style Guide
3. Policies
4. Midterm Project: Memory Allocation and Reclamation
5. Final Project: Vroomba Programming
1. Chapter 01: Introduction
2. Chapter 02: Working with Arrays
2.1. Arrays and Operations on Them
2.2. Insertion Sort on Arrays
2.3. Selection Sort
2.4. Exercises
3. Chapter 03: Complexity of Algorithms and Order Notation
4. Chapter 04: Divide-and-Conquer Algorithms
5. Chapter 05: Binary Heaps and Priority Queues
6. Chapter 06: Abstract Data Types
7. Chapter 07: Hashing-Based Data Structures
8. Chapter 08: Searching in Strings
9. Chapter 09: Backtracking and Dynamic Programming
10. Chapter 10: Data Encoding and Compression
11. Chapter 11: Binary Search Trees
12. Chapter 12: Graph Algorithms
13. Chapter 13: Elements of Computational Geometry
YSC2229: Introductory Data Structures and Algorithms
»
2.
Chapter 02: Working with Arrays
2.
Chapter 02: Working with Arrays
2.1. Arrays and Operations on Them
2.2. Insertion Sort on Arrays
2.2.1. Tracing Insertion Sort
2.2.2. Insertion Sort Invariants
2.2.3. Termination of Insertion Sort
2.3. Selection Sort
2.3.1. Tracing Selection Sort
2.3.2. Invariants of Selection Sort
2.3.3. Termination of Selection Sort
2.4. Exercises
2.4.1. Exercise 1
2.4.2. Exercise 2
2.4.3. Exercise 3
2.4.4. Exercise 4
2.4.5. Exercise 5