Algorithms: longest common subsequence (dynamic programming example) Three secrets for doing well in your university exams (Algorithms) Priority Queues and Binomial Heaps (Algorithms) Hash Tables (Algorithms) B-Trees (Algorithms) Red-Black Trees (Algorithms) 2-3-4 Trees (Algorithms) Binary Search Trees (Algorithms) Algorithms: list, tree, stack, queue, dictionary (elementary data structures) Algorithms: What can the Sinclair ZX Spectrum teach you about data structures, memory and pointers? Algorithms: algorithm design strategies Algorithms: Huffman compression (another greedy algorithm) Algorithms: greedy solution to hall allocation problem (cheaper!) Algorithms: hall allocation (dynamic programming example) Introducing Algorithms: three hard problems (Algorithms @ Cambridge) Algorithms: find optimal order for a chain of matrix multiplications (dynamic programming example) Algorithms: rod cutting (dynamic programming example) Algorithms: dynamic programming introduction Algorithms: sorting algorithms compared Algorithms: how to sort in linear time: counting sort, bucket sort, radix sort Algorithms: quicksort, median, order statistics, stability Algorithms: the heap is amazing! Here is one more reason why: the asymptotic cost to build one. Algorithms: Heapsort Algorithms: Mergesort Algorithms: selectsort, binary insertsort, bubblesort Algorithms: the cost of sorting Algorithms: asymptotic complexity, big-O notation, big-Theta, big-Omega, small-o, small-omega Algorithms: insertsort