Design and analysis
of algorithms; mathematical complexity of algorithms; master theorem;
decrease-and-conquer; divide-and-conquer; transform-and-conquer; introduction
to some optimization techniques; dynamic programming; greedy technique;
iterative improvement; coping with limitations of algorithm power.
Course information
0%