Tag: data stuctures
-
Upcoming changes on RabinsXP
Recently, I have got malware on RabinsXP as this site was not that much updated since it was first built in 2001. I had used the same WordPress theme which I had initially built back in 2001 and had again changed it’s look back in 2009. Since then the site is almost the same. I…
-
The Benefits of Artificial Intelligence in Future
Artificial Intelligence Future Artificial Intelligence has been around for quite some time now. It includes some technologies and techniques that have grown over many years. Moreover, it can also find quicker ways for different industries to improve their business and help humankind in a better way. Strong artificial intelligence is something which will undoubtedly revolutionize…
-
Ackermann Function
Ackermann Function is the simplest example of a well defined total function which is compatible but not primitive recursive. It grows faster than an exponential function. /* Ackermann Function */ #include<stdio.h> #include<stdlib.h> int count = 0, indent = 0; int ackermann(int x, int y) { count++; if(x<0 || y<0) return -1; if(x==0) return y+1; if(y==0)…
-
Infix Expression to Post-fix (Reverse police) Notation
Here we just look out the code on Infix to Postfix expression notation. It is also known as Reverse police method. Find the full code snippet below. Sample Code of Reverse Police Method /* Infix expression to post-fix (Reverse police) notation RabinsXp.com */ #include<stdio.h> #include<ctype.h> #define MAX 100 typedef struct stack { int data[MAX]; int…