Skip to main content

Virahanka Numbers : An Application of recursion

Brief History Of Computer. The computer as we know it today had its beginning with a 19th century English mathematics professor name Charles Babbage. He designed the Analytical Engine and it was this design that the basic framework of the computers of today are based on.

But recursion seems to be existing much before we thought of a machine for calculation.
Here's the Virahanka's problem in brief :
Find number of of poetic meters with 8 beats, made of:
• Short syllables, each 1 beat duration
• Long syllables, each  2 beat duration 

And the solution was V(D) = V(D-1)+V(D-2) for D> 2 . Given V(1)=1 and V(2)=2.

Credits : https://www.cse.iitb.ac.in/~cs101/2012.2/resources/VirahankaNumbers.pdf

Comments

Post a Comment

Popular posts from this blog

ASCII to Decimal conversion

#include "msp430.h"                     ; #define controlled include file         NAME    main                    ; module name         PUBLIC  main                    ; make the main label vissible                                         ; outside this module         ORG     0FFFEh         DC16    init                    ; set reset vector to 'init' label         RSEG    CSTACK                  ; pre-declaration of segment         RSEG    CODE      ...
Post a Comment
Read more

Event Sourcing with CQRS.

  The way event sourcing works with CQRS is to have  part of the application that models updates as writes to an event log or Kafka topic . This is paired with an event handler that subscribes to the Kafka topic, transforms the event (as required) and writes the materialized view to a read store.
Post a Comment
Read more