More recursion exercises

Author: Blooverh

PythonDataStructsAndAlgo/Notes.md

@@ -52,4 +52,5 @@
 
 > This can be done from the copy module using the deepcopy() function.
 
-> To produce an array of 8 elements with a value 0 we can do: counters= [0] *8, meaning all the cells in the list reference to the same object "0"
+> To produce an array of 8 elements with a value 0 we can do: counters= [0] *8, meaning all the cells in the list reference to the same object "0"
+

PythonDataStructsAndAlgo/Recursion/C-4-17.py

@@ -6,6 +6,9 @@ def isPalindrome(str):
     if str[0] != str[-1]:
         return False
     print(str)
+    """Every time the function is called the array decrements in size and the 
+    first and last elements are ignored, thus traveling through the array
+    Thus with recursion the size of the array decreases """
     return isPalindrome(str[1:-1])
 
 print(isPalindrome('racecar'))

PythonDataStructsAndAlgo/Recursion/C-4-18.py

@@ -0,0 +1,11 @@
+def whichHasMore(str):
+    vowels=['a','e','i','o','u']
+
+    if len(str) == 0:
+        return 0
+    if str[0] not in vowels:
+        return 1 + whichHasMore(str[1:])
+    else:
+        return whichHasMore(str[1:])
+
+print(whichHasMore("hoi"))