Description

FIT2004 (2026) Week 1 -3 Notes Learning Objectives: Divide and Conquer Complexity analysis Solving recurrence relations Correctness proofs (loop invariants) Limits of comparison-based sorting Non-comparison based sorting algorithms Divide and Conquer Quicksort Quickselect Median of medians


Monash

Semester 1, 2026


17 pages

4,361 words

$54.00

Add to cart

Campus

Monash, Clayton

Member since

April 2026

Other related note