Algorithms and Complexity
Auteur : Herbert S. Wilf
Date de publication : 1986
Éditeur : Prentice-Hall
Nombre de pages : 231
Résumé du livre
A textbook for a senior undergraduate course in discrete algorithms for students of computer science or mathematics who have completed a course in continuous algorithms or numerical analysis. Many opportunities are provided for students to write, debug, and use programs that are nontrivially recursive. Annotation copyrighted by Book News, Inc., Portland, OR