Introduction to Algorithms in Pascal

Fülszöveg

A clearly written, accessible INTRODUCTION TO ALGORITHMS This easy-to-read introduction makes algorithms clear and comprehensible to anyone with a basic computer science background and somé knowledge of discrete math! Thomas Parsons, Professor of Computer Science at Hofstra University, presents a complete introduction to algorithms written in PASCAL. He includes datastructure topics and analysis to make the text and algorithms remarkably clear and comprehensible. Chapters are selfcontained so readers do not have to refer to earlier chapters to find information, and the conci^e and up-to-date coverage includes many recent algorithms of note. , INTRODUCTION TO ALGORITHMS IN PASCAL • Includes chapters on pattern matching, text compression and random numbers that serve as case studies. These case studies apply somé of the algorithms covered earlier in the book. • Covers the generation and use of pseudorandom numbers, a topic frequently slighted in similar books. • Employs a casual and... Tovább

Fülszöveg

A clearly written, accessible INTRODUCTION TO ALGORITHMS This easy-to-read introduction makes algorithms clear and comprehensible to anyone with a basic computer science background and somé knowledge of discrete math! Thomas Parsons, Professor of Computer Science at Hofstra University, presents a complete introduction to algorithms written in PASCAL. He includes datastructure topics and analysis to make the text and algorithms remarkably clear and comprehensible. Chapters are selfcontained so readers do not have to refer to earlier chapters to find information, and the conci^e and up-to-date coverage includes many recent algorithms of note. , INTRODUCTION TO ALGORITHMS IN PASCAL • Includes chapters on pattern matching, text compression and random numbers that serve as case studies. These case studies apply somé of the algorithms covered earlier in the book. • Covers the generation and use of pseudorandom numbers, a topic frequently slighted in similar books. • Employs a casual and intuitíve approach in the presentation of material, encouraging readers to understand why a particular technique has been developed. • Provides two definitions of each topic-the first is informál and basic, and lays the groundwork for the more formai definition to follow. • Addresses the need for data structures coverage in undergraduate algorithms courses, as outlined by the ACM. A parallel book, INTRODUCTION TO ALGORITHMS IN C, is alsó available. (ISBN: 0-471-30595-2) Vissza