Mathematics and Computer Science: Some Useful Notations. Complexity of an Algorithm. Specification, invariants, iteration. Diminish and resolve, recursion. Try and error. PSEP. Greedy Algorithms. Divide and Conquer. Dynamic Programming. List of the Exercises.
Note: Includes bibliographical references and index. Note: Description based on CIP data; resource not viewed.
Access Rights:
Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
Access Usage:
Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.