Nsryjdtyk

I had a program test me on code written and executed in the browser. The test cases were all hidden, and I passed 9 out of 13 test cases that were hidden.

I used a library feature when my time was running out to see if I was just crazy. Sure enough, the test with the library example passed all 13 tests.

The problem was asking to implement a GCD program on an array of positive integers. I did checks on the data types and to validate the entries that were coming in. Assume that we only have working examples and zero is not positive. Assume num is not less than zero.

I will run benchmarks to see if there is a drastic difference...

NOTE: The tests are Python 2.7 specific.

def mGCD(num, arr):

  #Python3 and Python2 executable

  workthese = arr[:num]

  smallest  = min(workthese)

  if smallest == 0:

     return None

  if smallest == 1:

     return 1

  for i in range(0, num):

     if workthese[i]%smallest != 0:

        break

     if i == num-1:

        return smallest

  return 1



def pGCD(num, arr):

  #Python2 executable

  '''

  Equivalent to:

     >>> lis = (30,40,60,70)

     >>> res = gcd(*lis[:2])  #get the gcd of first two numbers

     >>> for x in lis[2:]:    #now iterate over the list starting from the 3rd element

     ...    res = gcd(res,x)

     >>> res

     10

  '''

  from fractions import gcd

  workthese = arr[:num]

  return reduce(gcd,(workthese))



if __name__ == "__main__":

  assert mGCD(1, [2,4,6]) == 2

  assert mGCD(3, [2,4,6]) == 2

  assert mGCD(3, [6,4,2]) == 2

  assert mGCD(2, [2,4,5]) == 2

  assert mGCD(2, [13,39]) == 13

  assert mGCD(2, [39,13]) == 13

  assert mGCD(2, [39,13,1]) == 13



  assert pGCD(1, [2,4,6]) == 2

  assert pGCD(3, [2,4,6]) == 2

  assert pGCD(3, [6,4,2]) == 2

  assert pGCD(2, [2,4,5]) == 2

  assert pGCD(2, [13,39]) == 13

  assert pGCD(2, [39,13]) == 13

  assert pGCD(2, [39,13,1]) == 13