draw flow chart & write pseudo code for greatest common divisor of two numbers
Sure! I can help you with that.
Let's start by creating a flowchart for finding the greatest common divisor (GCD) of two numbers. The flowchart will show the step-by-step process of calculating the GCD.
Here is a sample flowchart for finding the GCD of two numbers:
```
START
Input two numbers, num1 and num2
IF num1 is less than or equal to 0 OR num2 is less than or equal to 0
Output "Numbers should be positive"
ELSE
WHILE num2 is not equal to 0
Set temp variable as num2
Set num2 as num1 modulo num2
Set num1 as temp
Output "The GCD is num1"
END
```
Now, let's write the pseudo-code based on the flowchart:
```
FUNCTION gcd(num1, num2)
IF num1 <= 0 OR num2 <= 0
RETURN "Numbers should be positive"
END IF
WHILE num2 != 0
temp = num2
num2 = num1 % num2
num1 = temp
END WHILE
RETURN num1
END FUNCTION
```
In this pseudo-code, we define a function called `gcd()` that takes two numbers as parameters `num1` and `num2`. It first checks if the numbers are positive. If not, it returns a message indicating the numbers should be positive.
Next, there is a while loop that continues until `num2` becomes zero. Inside the loop, we swap the values of `num1` and `num2` and update `num2` with the remainder of `num1` divided by `num2`.
Finally, the function returns `num1`, which is the calculated GCD.
You can implement this pseudocode in the programming language of your choice.