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.
"synopsis" may belong to another edition of this title.
'The text is well presented and the content highly readable.' Computer Bulletin
'... a pleasing and useful elementary textbook on recursion. The didactic style and practical orientation of the book should encourage and enable students to master recursion ...' The Times Higher Education Supplement
"About this title" may belong to another edition of this title.
£ 2.80 shipping within United Kingdom
Destination, rates & speedsSeller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Paperback. Condition: Fair. A readable copy of the book which may include some defects such as highlighting and notes. Cover and pages may be creased and show discolouration. Seller Inventory # GOR004069447
Quantity: 1 available
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP78900228
Quantity: 1 available
Seller: Ammareal, Morangis, France
Softcover. Condition: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2008. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2008. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-596-250
Quantity: 1 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 340. Seller Inventory # C9780521269346
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521269346
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780521269346_new
Quantity: Over 20 available
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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521269346
Quantity: 1 available
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. Seller Inventory # __0521269342
Quantity: 1 available
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. Seller Inventory # 8386949
Quantity: 4 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 204. Seller Inventory # 26542298
Quantity: 4 available