menu
{ "item_title" : "Recursion Via Pascal", "item_author" : [" J. S. Rohl", "Rohl "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/52/126/934/0521269342_b.jpg", "price_data" : { "retail_price" : "73.00", "online_price" : "73.00", "our_price" : "73.00", "club_price" : "73.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Recursion Via Pascal|J. S. Rohl

Recursion Via Pascal

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9780521269346
  • ISBN-10: 0521269342
  • Publisher: Cambridge University Press
  • Publish Date: July 1984
  • Dimensions: 9 x 6 x 0.47 inches
  • Shipping Weight: 0.67 pounds
  • Page Count: 204

Related Categories

You May Also Like...

    1

BAM Customer Reviews