I have written a efficient code to find GCD of Two numbers. In this code I have used simple looping techniques. It is restricted to two numbers only. A better approach can be to solve it using recursion.
paltuabhi/GCD
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|