We will go through the quicksort and quickselect algorithms for sorting and selecting the kth smallest ... Next we will study the design of hash functions and their analysis. Finally, we present and ...

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include ... shortest paths, searching, and sorting. Required for computer science majors.

Basic toolkit for the design and analysis of algorithms ... divide-and-conquer, greedy algorithms, randomisation in algorithms, sorting algorithms, algorithmic lower bounds, graph algorithms. This ...