Introduction In this tutorial, we are going to create a containerized machine learning application. It is a simple application but it can be used as a template to build a more serious one. I hope by the end of this post you will have a basic idea about the following cool topics and technologies: Machine

This post is a rewrite of the following article but in Python Python code def IterativeBinarySearch(A, key, l, r): # As long as left index is less than right index while l A[m]: # Update the left index l = m + 1 # We found the key else: return m # Key was not

Problem Write a Python recursive function to compute the product of two positive integers. Solution The product of two positive integers (A*B) is nothing but the sum of the first integer (A), (B) times Code Here is the code in Python //Includes def RecursiveProduct(a, b): # Base case 1 if a == 0 or b

Fore more information please refer to the following post. This post only implements the solution in Python Code def RecursiveAvg(A, i, n): # Base case if i == n-1: return A[i]/n return A[i]/n + RecursiveAvg(A, i + 1, n) A = [1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0] print "Average of A

Refer to the following post for more details. This post is only Python implementation Python code # Integer division calculator def Division(numerator, denominator): # Divide by zero special case if denominator == 0: return [-999, -999] # Both are equal special case if numerator == denominator: return [1, 0] quotient = 0 # Get the

For definition and explanation please refer to the following post. This post is only implementation in Python. Python code # Function recieves the input array A def MCSS (A): # Auxiliary array B = # MCSS ending at position 0 is just the first element B.append(A[0]) # Populate B for i in range (1,

For definition and C++ implementation you may refer to the following post. This post reimplements it in Python. Python code # N = 0 1 2 3 4 5 6 7 # Fibonacci (N) = 0 1 1 2 3 5 8 13 def Fibonacci (N): # Initial case is 0 by definition if N

For definition and more details please refer to the following post. This post only reimplements the code in Python. Python Code def RecursiveExp(x, n): # First base case if n == 0: return 1 # Second base case if n == 1: return x # Even values of (n) if n % 2 == 0:

Definition Please refer to the following article for definition. This article reimplements it in Python. Code def isAmicable(n, m): # Sum of (n) proper divisors ns = 0 # Sum of (m) proper divisors ms = 0 # Boolean: 1 if the sum of (n) proper divisors equals to (m) nb = 0 # Boolean:

Problem Given two integers A less than B. Write Python code to find the greatest common divisor between A and B commonly known as GCD. Definition GCD(A, B) is the largest positive integer that divides A and B without a remainder. We can loop starting at 2 ending at A and whenever we find a