Merge branch 'master' into array-binary-search

Author: MsDiala

.vscode/settings.json

@@ -1,4 +1,5 @@
 {
     "ponicode.testSettings.testLocation.locationType": "Same folder as source file",
-    "ponicode.testSettings.testLocation.path": "{rootDir}/{filePath}/{fileName}.test.{ext}"
+    "ponicode.testSettings.testLocation.path": "{rootDir}/{filePath}/{fileName}.test.{ext}",
+    "python.pythonPath": ".venv/bin/python3.9"
 }

README.md

@@ -1,5 +1,6 @@
 # data-structures-and-algorithms-python
 
+
 # Challenge Summary
 Write a function called BinarySearch which takes in 2 parameters: a sorted array and the search key. Without utilizing any of the built-in methods available to your language, return the index of the array’s element that is equal to the search key, or -1 if the element does not exist.
 ## Challenge Description
@@ -11,4 +12,4 @@ OUTPUT => 2
 ## Solution![Getting Started](ALGO3.png)
 
 
-https://github.com/MsDiala/data-structures-and-algorithms-python/pull/3 
+https://github.com/MsDiala/data-structures-and-algorithms-python/pull/3 

data_structures_and_algorithms/challenges/array_reverse/__pycache__/array_shift.cpython-38.pyc

@@ -0,0 +1,8 @@
+def array_shift(l,b):
+  middle = len(l) // 2
+  if len(l) % 2 == 0:
+
+    return l[:middle] + [b] + l[middle:]
+  else:
+    return l[:middle + 1] + [b] + l[middle +1:]
+

data_structures_and_algorithms/challenges/array_reverse/array_shift.py

@@ -0,0 +1,49 @@
+# put your array_reverse challenge tests here
+from data_structures_and_algorithms.challenges.array_reverse.array_shift import array_shift
+
+
+# "Happy Path" cases
+# test should pass for array with number of even element where elements are integers
+def test_one():
+  expected = [1,2,5,3,4]
+  actual = array_shift([1,2,3,4],5)
+  assert actual == expected
+
+# test should pass for array with number of even element where elements are letters
+def test_two():
+  expected = ['a','b','z','c','d']
+  actual = array_shift(['a','b','c','d'],'z')                  
+  assert actual == expected
+
+# test should pass for array with odd number of elements where elements are letters and integers
+def test_three():
+  expected = [1,2,3,'a',4,5]
+  actual = array_shift([1,2,3,4,5],'a')
+  assert actual == expected
+
+
+
+# Edge Case
+# test should pass for initial array with only 2 elements
+def test_four():
+  expected = [1,2,1]
+  actual = array_shift([1,1],2)
+  assert actual == expected
+
+
+
+# Expected Failure
+# test should pass for initial array with elements ptinted with spaces
+def test_five():
+  expected = [1,2,9,3]
+  actual = array_shift([ 1 ,  2 , 3 ],9)
+  assert actual == expected
+
+# test should pass for initial array with only one element
+def test_six():
+  expected = [1,2]
+  actual = array_shift([1],2)
+  assert actual == expected
+
+
+