CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...

We will go through the quicksort and quickselect algorithms for sorting and selecting the kth smallest element in an array efficiently. This will also be an introduction to the role of randomization ...

Programming languages: Intermediate to advanced experience with Python Math ... quantum parallelism and ends with a presentation of Grover's search algorithm. We will have a brief introduction to IBM ...