EdusalsaDiscover Your Stanford

Ebru Hosgur

1 results

  • CS 161

    Design and Analysis of Algorithms

    • autumn
    • winter
    • summer
    • 2021-2022

    3 - 5 units

    Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching, amortized analysis, stable matchings and approximation algorithms. Prerequisite: 103 or 103B; 109 or STATS 116.

Filter results