7 kyu
Greatest common divisor
3,604 of 18,191RVdeKoning
Description:
Find the greatest common divisor of two positive integers. The integers can be large, so you need to find a clever solution.
The inputs x and y are always greater or equal to 1, so the greatest common divisor will always be an integer that is also greater or equal to 1.
Algorithms
Fundamentals
Recursion
Similar Kata:
Stats:
| Created | Mar 11, 2015 |
| Published | Mar 12, 2015 |
| Warriors Trained | 26195 |
| Total Skips | 490 |
| Total Code Submissions | 47969 |
| Total Times Completed | 18191 |
| Python Completions | 3604 |
| Haskell Completions | 249 |
| JavaScript Completions | 11378 |
| Ruby Completions | 458 |
| CoffeeScript Completions | 36 |
| PHP Completions | 292 |
| C# Completions | 462 |
| Java Completions | 1274 |
| C Completions | 250 |
| C++ Completions | 510 |
| COBOL Completions | 9 |
| Rust Completions | 114 |
| Go Completions | 128 |
| NASM Completions | 8 |
| TypeScript Completions | 107 |
| Total Stars | 285 |
| % of votes with a positive feedback rating | 90% of 1486 |
| Total "Very Satisfied" Votes | 1233 |
| Total "Somewhat Satisfied" Votes | 213 |
| Total "Not Satisfied" Votes | 40 |
