Merge pull request #158 from sel3ne/master

fixed LinearSearch name and impleneted tests

Author: larissalages

classical_algorithms/python/Linear Search .py

@@ -0,0 +1,37 @@
+def linear(arr,n,x):
+  if arr == []:
+    return -1
+
+    
+  for i in range(n):
+      if(arr[i] == x):
+          return i
+  return -1
+
+# not executing unnless called
+if __name__=='__main__':
+  n = int(input("Enter the total number of elements\n"))
+  arr =list(map(int,input().split()))
+  x = int(input("Enter which element you want to find\n"))
+  result = linear(arr,n,x)
+  if (result == -1):
+          print("Element not found")
+  else:
+          print("Element found at" ,result+1,"pos")
+
+        
+
+
+    
+
+
+    
+
+
+
+    
+
+    
+
+
+    

classical_algorithms/python/LinearSearch.py

@@ -0,0 +1,32 @@
+import unittest
+from classical_algorithms.python.LinearSearch import linear
+
+# linear(arr,n,x):
+
+class TestLinaerSearch(unittest.TestCase):
+  def test_linear_search(self):
+
+    print('None Array')
+    self.assertRaises(TypeError, linear(None,0,12))
+
+    print('None Search')
+    self.assertRaises(TypeError, linear([12,22],2,None))
+
+    print('Empty Array')
+    self.assertEqual(linear([],2,12), -1)
+
+    print('Wrong size')
+    self.assertRaises(TypeError, linear([1,2,3], 5, 2))
+
+    print('One Element')
+    self.assertEqual(linear([12], 1, 12), 0)
+
+    print('Multiple Elements')
+    self.assertEqual(linear([-100, -12, -1, 0, 1,2,3,4, 100], 9, 3), 6)
+
+
+
+
+
+if __name__=='__main__':
+  unittest.main()