DSpace at KSIT Library >
Mathematics >
Algorithms >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/433
|
Title: | Algorithms and Complexity |
Authors: | Wilf, Herbert S. |
Keywords: | Algorithms |
Issue Date: | 1994 |
Publisher: | University of Pennsylvania |
Abstract: | An algorithm is a method for solving a class of problems on a computer. The complexity of an algorithm is the cost, measured in running time, or storage, or whatever units are relevant, of using the algorithm to solve one of those problems.
This book is about algorithms and complexity, and so it is about methods for solving problems on computers and the costs (usually the running time) of using those methods. |
Description: | Copyright belongs to Herbert S. Wilf. |
URI: | http://hdl.handle.net/123456789/433 |
Appears in Collections: | Algorithms
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|