Description
Instructor(s)/Supervisor(s)/Coordinator(s): Dimitrios PAPADIAS, Huiru XIAO, Siu Wing CHENGTechniques for designing algorithms, proving their correctness, and analyzing their running times. Topics covered include: sorting, selection, heaps, balanced search trees, divide-and-conquer, greedy algorithms, dynamic programming, and graph algorithms.