diff options
Diffstat (limited to 'docs/source/_static/QuickStart')
5 files changed, 71 insertions, 0 deletions
diff --git a/docs/source/_static/QuickStart/simple_assessment.yml b/docs/source/_static/QuickStart/simple_assessment.yml new file mode 100644 index 0000000..414f00b --- /dev/null +++ b/docs/source/_static/QuickStart/simple_assessment.yml @@ -0,0 +1,12 @@ +name: simple_assessment +files: + - euclid.py: + functions: + - gcd(2) + tests: + - | + assert euclid.gcd(8,12) == 4 + run: + - python euclid.py: + regexes: + - ^4 diff --git a/docs/source/_static/QuickStart/simple_submission_1/euclid.py b/docs/source/_static/QuickStart/simple_submission_1/euclid.py new file mode 100644 index 0000000..f72707a --- /dev/null +++ b/docs/source/_static/QuickStart/simple_submission_1/euclid.py @@ -0,0 +1,22 @@ +# the newest! +# assessment 1 + +def gcd(m,n) -> int: + """Calculates the greatest common denominator between two numbers. + + Args: + x (int): Number One + y (int): Number Two + + Returns: + int: The GCD of the two numbers + """ + if m< n: + (m,n) = (n,m) + if(m%n) == 0: + return n + else: + return (gcd(n, m % n)) # recursion taking place + +# gcd +print(gcd(8,12)) diff --git a/docs/source/_static/QuickStart/simple_submission_2/euclid.py b/docs/source/_static/QuickStart/simple_submission_2/euclid.py new file mode 100644 index 0000000..0819bc5 --- /dev/null +++ b/docs/source/_static/QuickStart/simple_submission_2/euclid.py @@ -0,0 +1,10 @@ +def gcd(m,n): + if m< n: + (m,n) = (n,m) + if(m%n) == 0: + return n + else: + return (gcd(n, m % n)) # recursion taking place + +# calling function with parameters and printing it out +print(gcd(8,12)) diff --git a/docs/source/_static/QuickStart/simple_submission_3/euclid.py b/docs/source/_static/QuickStart/simple_submission_3/euclid.py new file mode 100644 index 0000000..73e7d9c --- /dev/null +++ b/docs/source/_static/QuickStart/simple_submission_3/euclid.py @@ -0,0 +1,11 @@ +def gcd(p,q): + """Docstring gcd""" + if p < q: + (p,q) = (q,p) + if(p%q) == 0: + return q + else: + return (gcd(q, p % q)) # recursion taking place + +# calling function with parameters and printing it out +print(gcd(8,12)) diff --git a/docs/source/_static/QuickStart/simple_submission_4/euclid.py b/docs/source/_static/QuickStart/simple_submission_4/euclid.py new file mode 100644 index 0000000..064d1e5 --- /dev/null +++ b/docs/source/_static/QuickStart/simple_submission_4/euclid.py @@ -0,0 +1,16 @@ +# assessment A +# student id: 4 + +def gcd(x,y): + if x > y: + small = y + else: + small = x + for i in range(1, small+1): + if((x % i == 0) and (y % i == 0)): + g = i + + return g + +# calling function with parameters and printing it out +print(gcd(8,12)) |