1. Longest Common Subsequence
2. Tower Of Hanoi
3. Tower of Hanoi program in java
System programming, Cluster computing, Writing Operating System, iOS application Development, Advanced C programming, Assembly langauge, C++
#include <stdio.h> #include <strings.h> #define MAX(x, y) (((x) > (y)) ? (x) : (y)) #define MIN(x, y) (((x) < (y)) ? (x) : (y)) int lcs(char *s1, char *s2) { if (strlen(s1) == 0 || strlen(s2) == 0) return 0; if (*s1 == *s2) { return 1+lcs(s1+1, s2+1); } else { return MAX(lcs(s1+1, s2), lcs(s1, s2+1)); } } int main() { char s2[] = "abcd"; char s1[] = "efgh"; printf("%d\n", strlen(s2)); int c = lcs(s1, s2); printf("%d count = %d\n", c, count); }