Merge pull request #20 from atousa1/master

jaccard similarity added

Author: cozek

algorithms/Searching/linear_search.m

@@ -0,0 +1,25 @@
+function p = linear_search(A,t)
+%% linear Search
+% This function linear searches target value (t) in array A. 
+% For this, It sequentially checks each entry of the array until a match is found
+% or  or the whole list has been searched.
+% If it can find the target returns 1 otherwise 0. 
+
+array_length = length(A);
+i = 1;
+searchTermination = 0;
+
+while searchTermination == 0 && i < array_length+1
+    if A(i) == t
+        p = 1;
+        searchTermination = 1;
+        disp('the target is found in the array')
+    else
+        i = i+1;
+    end
+end
+if i == array_length+1
+    p = 0;
+    disp('the target is not found in the array')
+end
+end

algorithms/maths/jaccard_similarity.m

@@ -0,0 +1,35 @@
+function p = jaccard_similarity(A,B)
+%% jaccard similarity
+% This function calculates jaccard similarity index of inputs arrays A and
+% B. The formula to find the Index is (number of entries in both sets) / (number of entries in either set) * 100
+% The higher the percentage, the more similar the two arrays. 
+% For this, each of input arrays is modified by removing its same entries
+% (except on them), then number of common entries between two new arrays is
+% calculated by comparing them. 
+
+modified_A = unique(A);
+modified_B = unique(B);
+
+length_mA = length(modified_A);
+length_mB = length(modified_B);
+common_number = 0;                    %initialize the number of common entries 
+
+if length_mA <= length_mB
+    X = modified_A;
+    Y = modified_B;
+else
+    X = modified_B;
+    Y = modified_A;
+end
+
+for i = 1:length(X)
+    for j = 1:length(Y)
+        if X(i) == Y(j)
+           common_number = common_number + 1;
+        end
+    end
+end
+
+total_number = length_mA + length_mB - common_number;
+p = (common_number/total_number)*100;
+end