How to Think About Algorithms

CAMBRIDGE UNIVERSITY PRESS
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, Sao Paulo, Delhi

Cambridge University Press
32 Avenue of the Americas, New York, NY 10013-2473, USA

www.cambridge.org
Information on this title: www.cambridge.org/9780521614108

This publication is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press.

First published 2008

Printed in the United States of America

A catalog record for this publication is available from the British Library.

Library of Congress Cataloging in Publication data

Edmonds, Jeff, 1963–
How to think about algorithms / Jeff Edmonds.
    p. cm.
Includes index.
ISBN 978-0-521-84931-9 (hardback) – ISBN 978-0-521-61410-8 (pbk.)
1. Algorithms – Study and teaching. 2. Loops (Group theory) – Study and teaching. 3. Invariants – Study and teaching. 4. Recursion theory – Study and teaching. I. Title.
QA9.58.E36  2008
518′.1–dc22       2008001238

ISBN 978-0-521-84931-9 hardback
ISBN 978-0-521-61410-8 paperback

Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party Internet Web sites referred to in this publication and does not guarantee that any content on such Web sites is, or will remain, accurate or appropriate.