Add files via upload

Author: 5codeman

Diff for: Lecture 3 - Recursion 1/All Indices of Number.cpp

@@ -0,0 +1,20 @@
+int allIndexes(int input[], int size, int x, int output[]) {
+  /* Don't write main().
+     Don't read input, it is passed as function argument.
+     Save all the indexes in the output array passed and return the size of
+     output array. Taking input and printing output is handled automatically.
+  */
+  if (size == 0) {
+    return 0;
+  }
+
+  int ans = allIndexes(input, size - 1, x, output);
+
+  if (input[size - 1] == x) {
+    output[ans] = size - 1;
+    return ans + 1;
+  } 
+  else {
+    return ans;
+  }
+}

Diff for: Lecture 3 - Recursion 1/Check Number.cpp

@@ -0,0 +1,19 @@
+bool checkNumber(int input[], int size, int x) {
+  /* Don't write main().
+     Don't read input, it is passed as function argument.
+     Return output and don't print it.
+     Taking input and printing output is handled automatically.
+  */
+
+  if(size == 0)
+  {
+    return false;
+  }
+
+  if (input[0] == x) {
+    return true;
+  }
+
+  return checkNumber(input + 1, size - 1, x);
+
+}

Diff for: Lecture 3 - Recursion 1/Check Palindrome (recursive).cpp

@@ -0,0 +1,25 @@
+bool checkPalindrome(char input[], int size) 
+{
+    if(size == 0 || size == 1)
+    {
+      return true;
+    }
+
+    if(input[0] == input[size-1])
+    {
+      return checkPalindrome(input+1, size-2);
+    }
+
+    else
+    {
+      return false;
+    }
+
+}
+
+bool checkPalindrome(char input[]) {
+  // Write your code here
+  int length = 0;
+  for(int i=0; input[i] != '\0'; i++) length++;
+  return checkPalindrome(input, length);
+}

Diff for: Lecture 3 - Recursion 1/Count Zeros.cpp

@@ -0,0 +1,24 @@
+
+int countZeros(int n) {
+    // Write your code here
+    if(n == 0)
+    {
+        return 1;
+    }
+
+    if(n < 10)
+    {
+        return 0;
+    }
+
+    int ans = countZeros(n/10);
+
+    if(n % 10 == 0)
+    {
+        return ans+1;
+    }
+
+    return ans;
+}
+
+

Diff for: Lecture 3 - Recursion 1/First Index of Number.cpp

@@ -0,0 +1,25 @@
+int firstIndex(int input[], int size, int x) {
+  /* Don't write main().
+     Don't read input, it is passed as function argument.
+     Return output and don't print it.
+     Taking input and printing output is handled automatically.
+  */
+
+  if(size == 0)
+  {
+    return -1;
+  }
+
+  if(input[0] == x)
+  {
+    return 0;
+  }
+
+  int ans = firstIndex(input+1, size-1, x);
+
+  if(ans != -1)
+  {
+    return ans+1;
+  }
+  return -1;
+}

Diff for: Lecture 3 - Recursion 1/Geometric Sum.cpp

@@ -0,0 +1,11 @@
+double geometricSum(int k) {
+    // Write your code here
+    if(k == 0)
+    {
+        return 1;
+    }
+
+    float ans = geometricSum(k-1);
+
+    return ans + (1/pow(2,k));
+}

Diff for: Lecture 3 - Recursion 1/Last Index of Number.cpp

@@ -0,0 +1,30 @@
+int lastIndex(int input[], int size, int x) {
+  /* Don't write main().
+     Don't read input, it is passed as function argument.
+     Return output and don't print it.
+     Taking input and printing output is handled automatically.
+  */
+  if(size == 0)
+  {
+    return -1;
+  }
+
+  int ans = lastIndex(input+1, size-1, x);
+
+  if(ans == -1)
+  {
+    if (input[0] == x) 
+    {
+      return 0;
+    }
+    else 
+    {
+      return -1;
+    }
+  }
+  else 
+  {
+    return ans+1;
+  }
+
+ 

Diff for: Lecture 3 - Recursion 1/Multiplication (Recursive).cpp

@@ -0,0 +1,10 @@
+int multiplyNumbers(int m, int n) {
+    // Write your code here
+    if(n==0)
+    {
+        return 0;
+    }
+    int ans = multiplyNumbers(m,n-1);
+
+    return ans + m;
+}

Diff for: Lecture 3 - Recursion 1/Number of Digits.cpp

@@ -0,0 +1,12 @@
+int count(int n){
+    //write your code here
+
+    if(n == 0)
+    {
+        return 0;
+    }
+
+    int ans = count(n/10);
+
+    return ans + 1;
+}

Diff for: Lecture 3 - Recursion 1/Power.cpp

@@ -0,0 +1,15 @@
+int power(int x, int n) {
+  /* Don't write main().
+     Don't read input, it is passed as function argument.
+     Return output and don't print it.
+     Taking input and printing output is handled automatically.
+  */
+  if(n == 0)
+  {
+    return 1;
+  }
+
+  int ans = power(x, n-1);
+
+  return ans * x;
+}

Diff for: Lecture 3 - Recursion 1/Print Numbers.cpp

@@ -0,0 +1,13 @@
+void print(int n){
+    //write your code here
+
+    if(n == 1)
+    {
+        cout << n << " ";
+        return;
+    }
+
+    print(n-1);
+
+    cout << n << " ";
+}

Diff for: Lecture 3 - Recursion 1/Sum of Array.cpp

@@ -0,0 +1,17 @@
+int sum(int input[], int n) {
+  /* Don't write main().
+     Don't read input, it is passed as function argument.
+     Return output and don't print it.
+     Taking input and printing output is handled automatically.
+  */
+
+  if(n == 1)
+  {
+      return input[n-1];
+  }
+
+  int ans = sum(input+1, n-1);
+
+  return input[0] + ans;
+
+}

Diff for: Lecture 3 - Recursion 1/Sum of digits (recursive).cpp

@@ -0,0 +1,12 @@
+int sumOfDigits(int n) {
+    // Write your code here
+    if(n ==0)
+    {
+        return 0;
+    }
+
+    int ans = sumOfDigits(n/10);
+
+    return n%10 + ans;
+}
+