你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada The Recursion Sutras: Data Structures using Recursion. No Iterative Loops.
Type
Physical Book
Language
English
Pages
84
Format
Paperback
Dimensions
22.9 x 15.2 x 0.5 cm
Weight
0.14 kg.
ISBN13
9781980250265

The Recursion Sutras: Data Structures using Recursion. No Iterative Loops.

Champak Roy (Author) · Independently Published · Paperback

The Recursion Sutras: Data Structures using Recursion. No Iterative Loops. - Roy, Champak

New Book Imported to Taiwan
Delivery: 21 Sep - 02 Oct Shipping: 17 to 21 business days.
NT$ 581
NT$ 581

Synopsis "The Recursion Sutras: Data Structures using Recursion. No Iterative Loops. "

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.

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews