Isbn: 9780521269346 - recursion via pascal 2ed (cambridge computer science texts, 19) (5 Ergebnisse)

Paperback. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Zustand: Very Good. 1st Edition. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: New. In English.

Zustand: New. Series: Cambridge Computer Science Texts. Num Pages: 204 pages, d. BIC Classification: UMX. Category: (U) Tertiary Education (US: College). Dimension: 228 x 152 x 12. Weight in Grams: 310. . 2008. paperback. . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: 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.…