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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: R. Rivers Books, Running Springs, CA, USA
Soft cover. Zustand: 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. Bestandsnummer des Verkäufers BOOK2-050117004
Anzahl: 1 verfügbar
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Paperback. Zustand: 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. Bestandsnummer des Verkäufers GOR004069447
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 191 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand. Bestandsnummer des Verkäufers __0521269342
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9780521269346_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9780521269346
Anzahl: 10 verfügbar
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Bestandsnummer des Verkäufers C9780521269346
Anzahl: Mehr als 20 verfügbar
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Feb2215580248090
Anzahl: Mehr als 20 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 204. Bestandsnummer des Verkäufers 26542298
Anzahl: 4 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: 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. Bestandsnummer des Verkäufers 8386949
Anzahl: 4 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9780521269346