Build the theory first
Use 24 pages of handwritten notes to study asymptotic notation, recurrences, the Master Theorem, and the time and space costs of algorithm choices.
PROJECT 08 / Algorithm Design & Analysis
Handwritten theory and documented C examples connecting five algorithm design strategies with searching, sorting, optimisation, and string problems.
Coursework collection
Algorithm study & implementation collection
Divide & conquer · Greedy choices
Dynamic programming · BacktrackingConceptual learning flow from algorithm notes to C examples and complexity analysis.
THE PROJECT AT A GLANCE
Conceptual learning flow from algorithm notes to C examples and complexity analysis.
01 / OBJECTIVE
Connect algorithm design theory with worked examples, showing how different strategies shape the solution, state, and computational cost of a problem.
02 / MY CONTRIBUTION
My coursework collection brings together three units of handwritten notes and 11 implementation documents containing C programs and sample output screenshots. The repository organises the material by strategy and provides a learning path, complexity checkpoints, and implementation notes.
An academic study collection covering brute force, divide and conquer, greedy methods, dynamic programming, and backtracking. C programs are embedded in Word documents; the repository has no standalone C sources or automated build.
03 / TECHNICAL APPROACH
Use 24 pages of handwritten notes to study asymptotic notation, recurrences, the Master Theorem, and the time and space costs of algorithm choices.
Trace binary search, merge sort, quicksort, Dijkstra, knapsack, optimal binary search trees, graph coloring, sum of subsets, pattern matching, and longest common subsequence through the documented C examples.
Pair implementations with example outputs and complexity checkpoints. Extract one program at a time into a C source file, then review bounds, input assumptions, and the documented corrections before running it.
04 / OUTCOMES
An educational archive. Some algorithms appear only in the notes, and the implementation documents require extraction and review before compilation. The collection is not a tested algorithm library.
Want to talk about this project?
Get in touch