blob: b6dcc1646152723688af6fd288db1149ab0cb1f6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
============================= test session starts ==============================
platform linux -- Python 3.10.4, pytest-7.1.2, pluggy-1.0.0 -- /usr/bin/python3
cachedir: .pytest_cache
rootdir: /tmp/tmp398_c3x6/simple_submission_1
collecting ... collected 1 item
../tmp/tmp398_c3x6/simple_submission_1/test_euclid.py::test_1 PASSED [100%]
--------------- generated xml file: /tmp/tmpceag5_nn/report.xml ----------------
============================== 1 passed in 0.01s ===============================
4
=== simple_assessment - Student ID: 1 Automatic marking report ===
Report generated at 2022-05-01 15:49:15.701124
== Class Tree: ==
{}
== File Analysis ==
= euclid.py =
Documentation:
28 characters long
Comments:
```
# the newest!
# assessment 1
```
Docstring:
*** No docstring present ***
Functions:
gcd(2):
Arguments:
(m, n) -> int
Enough? YES
Documentation:
164 characters long
Comments:
*** No comments present ***
Docstring:
```
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
```
Source:
15 lines (356 characters)
Code:
```
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
```
Runtime Analysis:
Command `python euclid.py`:
Monitor:
stdout
Regexes:
`^4`:
Found occurrences: 1
Occurrences list:
4
Full runtime output:
```
4
```
|
