Items related to The Recursion Sutras: Data Structures using Recursion....

The Recursion Sutras: Data Structures using Recursion. No Iterative Loops. (Champak's Programming Series) - Softcover

 
Image Not Available

Synopsis

Most Software Engineers would remember their introduction to Recursion. The first impression is usually disorienting. Problems get solved without actually being solved. This happens while learning Quicksort and then Mergesort. These are based on Recursion and the other implementation is by using stacks which requires still more programming.The real encounter comes when you try solving problems like the Towers of Hanoi, Eight Queens Problem etc. The problems get solved perfectly even if it doesn't actually feel like you're solving it. Exciting, sinister, like it or love it but Recursion is the only way of solving those problems. Even if we were to use a stack, we would first design a Recursive solution and then remove the Recursion mechanically. Not necessary, because the compiler does the same.Recursion finds application in advanced fields of Computer Programming. 1. Look ahead in strategy games like Chess is implemented via Recursion.2. Regular Expressions, where you search text based on patterns is always implemented by Recursion.3. Many optimization and combinatorial problems like Dynamic Programming, Eight Queens Problem, solving a maze etc require Recursive formulations.In short, a deep understanding of Recursion helps in a Software Development Career.This book takes you deep into Recursion. We solve the basic problems of Data Structures recursively. This book doesn't use a single iterative loop, and we solve every type of problem. Take a look at the table of contents.DEFINING RECURSIONTHE INTEGER AS A RECURSIVE DATA STRUCTURESSUMMATION OF SERIES.PERMUTATIONS & COMBINATIONS.THE ARRAY AS A RECURSIVE DATA STRUCTURETHE LINKED LIST AS A RECURSIVE DATA STRUCTUREBINARY TREES AS RECURSIVE DATA STRUCTURESRECURSION AND FILESSOME INTERESTING PROBLEMS USING RECURSIONSUMMING UPWriting this book has been an engrossing task. Selecting problems, designing solutions , programming and testing has been particularly stimulating. Should have the same effects on the readers.

"synopsis" may belong to another edition of this title.

  • PublisherIndependently published
  • Publication date2018
  • ISBN 10 198025026X
  • ISBN 13 9781980250265
  • BindingPaperback
  • LanguageEnglish
  • Number of pages83

Search results for The Recursion Sutras: Data Structures using Recursion....

Stock Image

Roy, Champak
Published by Independently published, 2018
ISBN 10: 198025026X ISBN 13: 9781980250265
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLING22Oct2018170251592

Contact seller

Buy New

US$ 21.47
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Champak Roy
Published by Independently Published, 2018
ISBN 10: 198025026X ISBN 13: 9781980250265
New Paperback / softback
Print on Demand

Seller: THE SAINT BOOKSTORE, Southport, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 136. Seller Inventory # C9781980250265

Contact seller

Buy New

US$ 15.00
Convert currency
Shipping: US$ 10.47
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket