All projects

PROJECT 08 / Algorithm Design & Analysis

Modern Algorithms & Strategies

Handwritten theory and documented C examples connecting five algorithm design strategies with searching, sorting, optimisation, and string problems.

WHEN

Coursework collection

CONTRIBUTION

Algorithm study & implementation collection

TECHNOLOGIES
CDivide & conquerDynamic programmingGreedy algorithmsBacktracking
ALGORITHM DESIGN & ANALYSIS08
ALGORITHM DESIGNOne problem. Different strategies.
Theory → implementation → analysisDivide & conquer · Greedy choices
Dynamic programming · Backtracking
C examples11 documents24 pages of notes

Conceptual learning flow from algorithm notes to C examples and complexity analysis.

THE PROJECT AT A GLANCE

From a recurrence to a worked implementation.

Conceptual learning flow from algorithm notes to C examples and complexity analysis.

Design strategies
5
Implementation documents
11
Pages of handwritten notes
24

01 / OBJECTIVE

What the project set out to do

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 part in the work

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

How it came together

01

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.

02

Compare design strategies

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.

03

Connect code with assumptions

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

What the work produced

  • Organised algorithm theory and documented implementations into a linked study collection.
  • Connected strategy selection with recurrences, complexity, and worked examples.
  • Documented source formats, algorithm assumptions, and corrections for the archived examples.

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.

UP NEXT / PROJECT 09

Operating System Algorithms

View case study

Want to talk about this project?

Get in touch