Control Flow Graph and Cyclomatic Complexity for this Python Code
1. def is_prime(n): 2. if n <= 1: 3. return False 4. if n == 2 or n == 3: 5. return True 6. if n % 2 == 0 or n % 3 == 0: 7. return False 8. i = 5 9. while i * i <= n: 10. if n % i […]
Control Flow Diagram and Cyclomatic Complexity for this Python Code
1. def is_prime(n): 2. if n <= 1: 3. return False 4. if n == 2 or n == 3: 5. return True 6. if n % 2 == 0 or n % 3 == 0: 7. return False 8. i = 5 9. while i * i <= n: 10. if n % i […]