|
|
|
The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms.
http://www.aduni.org/courses/algorithms/index.php?
saved under Computer Science Video Lectures/ADUNI
by
video_lectures
|
|