Algorithms Unlocked by Cormen, Thomas H. -- Read -- Imperial Library of Trantor

Index

Preface 1 2 3 4 5 6 7 8 9 10 Bibliography Index Contents Correctness Resource usage Computer algorithms for non-computer people Further reading How to characterize running times Loop invariants Recursion Binary search Selection sort Insertion sort Merge sort Quicksort Recap The lower bound on comparison sorting Beating the lower bound with counting sort Radix sort Directed acyclic graphs Topological sorting How to represent a directed graph Running time of topological sorting Shortest path in a directed acyclic graph Dijkstra’s algorithm The Bellman-Ford algorithm The Floyd-Warshall algorithm Transforming one string to another String matching Simple substitution ciphers Symmetric-key cryptography Public-key cryptography The RSA cryptosystem Hybrid cryptosystems Computing random numbers Huffman codes Fax machines LZW compression The classes P and NP and NP-completeness

Chief Librarian: Las Zenow <zenow@riseup.net>
Fork the source code from gitlab.