Teaching Pages
Courses CS 260 Design and Analysis of Algorithms Prerequisites: computer programming skills, probability, basic data structures and algorithms, basic discrete mathematics. The course covers main approaches to design and analysis of algorithms including important algorithms and data structures, and results in complexity and computability. The main contents are: review of algorithm analysis (search in ordered array, binary insertion sort, merge sort, worst-case and average-case time complexity, minimum complexity of sorting n elements for small n, 2-3 trees, asymptotic notation); divide and
