Language: English
Published by Cambridge University Press, 1984
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Better World Books, Mishawaka, IN, U.S.A.
First Edition
Condition: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Language: English
Published by Cambridge University Press, 1984
ISBN 10: 0521263298 ISBN 13: 9780521263290
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Language: English
Published by Cambridge University Press, 1984
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: R. Rivers Books, Running Springs, CA, U.S.A.
First Edition
Soft cover. Condition: Good. 1st Edition. Cambridge University Press, 1986. Reprint. Softcover. 6 x 9 ". 191 pp. Good. Previous owner's blind stamp on the lower tip of the front cover and to the lower tips of some of the inside pages. The text appears unmarked. The binding is solid.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Paperback. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 46.31
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by Cambridge University Press 2008-10-14, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press CUP, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 204.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: BennettBooksLtd, San Diego, NV, U.S.A.
paperback. Condition: New. In shrink wrap. Looks like an interesting title!
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 191 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 47.73
Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 204 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Language: English
Published by Cambridge University Press, Cambridge, 2002
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Language: English
Published by Cambridge University Press, 2008
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 204.
Language: English
Published by Cambridge University Press, Cambridge, 2002
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Language: English
Published by Cambridge University Press, 2002
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. InhaltsverzeichnisPreface 1. Introduction to recursion 2. Recursion with linked-linear lists 3. Recursion with binary trees 4. Binary recursion without trees 5. Double recursion, mutual recursion, recursive calls 6. Recursion with .
Language: English
Published by Cambridge University Press, Cambridge, 2002
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condition: new. Paperback. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Language: English
Published by Cambridge University Press, 2002
ISBN 10: 0521269342 ISBN 13: 9780521269346
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Recursion Via Pascal | J. S. Rohl (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2002 | Cambridge University Press | EAN 9780521269346 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.