-
Subscribe
Subscribed
Already have a WordPress.com account? Log in now.
In this attempt I have tried to code for more of a typical problem, finding longest increasing subsequence, which I will call LIS throughout. LIS is sister of a more general Longest Common Subsequence (LCS) problem used to find longest common subsequences in two strings. Both of them are solved using dynamic programming paradigm in … Continue reading
Since this is my first coding blog, its customary for me to start with Hello World. Here I go. C says Hello, int main(void){ printf(“Hello World\n”); } Python says Hello, print (“Hello World”) Erlang says Hello, -module(hello). -export([hello_world/0]). hello_world() -> io:fwrite(“hello, world\n”). Java says Hello, class myfirstjavaprog{ public static void main(String args[]){ System.out.println(“Hello World!”); … Continue reading
All Eyes On Code 