Data commit

Task/Longest-common-subsequence/Prolog/longest-common-subsequence-1.pro

@@ -0,0 +1,20 @@
+test :-
+    time(lcs("thisisatest", "testing123testing", Lcs)),
+    writef('%s',[Lcs]).
+
+	
+lcs([ H|L1],[ H|L2],[H|Lcs]) :- !,
+    lcs(L1,L2,Lcs).
+
+lcs([H1|L1],[H2|L2],Lcs):-
+    lcs(    L1 ,[H2|L2],Lcs1),
+    lcs([H1|L1],    L2 ,Lcs2),
+    longest(Lcs1,Lcs2,Lcs),!.
+
+lcs(_,_,[]).
+
+
+longest(L1,L2,Longest) :-
+    length(L1,Length1),
+    length(L2,Length2),
+    ((Length1 > Length2) -> Longest = L1; Longest = L2).

Task/Longest-common-subsequence/Prolog/longest-common-subsequence-2.pro

@@ -0,0 +1,29 @@
+%declare that we will add lcs_db facts during runtime
+:- dynamic lcs_db/3.
+
+test :-
+    retractall(lcs_db(_,_,_)), %clear the database of known results
+    time(lcs("thisisatest", "testing123testing", Lcs)),
+    writef('%s',[Lcs]).
+
+
+% check if the result is known
+lcs(L1,L2,Lcs) :-
+    lcs_db(L1,L2,Lcs),!.
+
+lcs([ H|L1],[ H|L2],[H|Lcs]) :- !,
+    lcs(L1,L2,Lcs).
+
+lcs([H1|L1],[H2|L2],Lcs) :-
+    lcs(    L1 ,[H2|L2],Lcs1),
+    lcs([H1|L1],    L2 ,Lcs2),
+    longest(Lcs1,Lcs2,Lcs),!,
+    assert(lcs_db([H1|L1],[H2|L2],Lcs)).
+
+lcs(_,_,[]).
+
+
+longest(L1,L2,Longest) :-
+    length(L1,Length1),
+    length(L2,Length2),
+    ((Length1 > Length2) -> Longest = L1; Longest = L2).

Task/Longest-common-subsequence/Prolog/longest-common-subsequence-3.pro

@@ -0,0 +1,3 @@
+?- time(lcs("beginning-middle-ending","beginning-diddle-dum-ending", Lcs)),writef('%s', [Lcs]).
+% 10,875,184 inferences, 1.840 CPU in 1.996 seconds (92% CPU, 5910426 Lips)
+beginning-iddle-ending

Task/Longest-common-subsequence/Prolog/longest-common-subsequence-4.pro

@@ -0,0 +1,3 @@
+?- time(lcs("beginning-middle-ending","beginning-diddle-dum-ending", Lcs)),writef('%s', [Lcs]).
+% 2,376 inferences, 0.010 CPU in 0.003 seconds (300% CPU, 237600 Lips)
+beginning-iddle-ending