Feeds
已提交
Greatest Common Divisor (direct step backwards) of any 2 nos
Without using any arrays, the direct method of finding GCD is implemented by while loop for any two numbers.
4 years 前 | 1 次下载 |
已提交
Greatest Common Divisor
The much improved version of GCD previous one uploaded.
4 years 前 | 1 次下载 |
已提交
Greatest Common Divisor
Greatest number which could divide both the entered numbers fully (evenly).
4 years 前 | 1 次下载 |
已提交
3D Mesh Over a Space Shuttle Nose to Capture Flow Around It
Bottom Clustering of Mesh is applied to capture the flow near to the surface of the shuttle's nose
4 years 前 | 1 次下载 |
已提交
Circle to Any Polygon Conversion
Enter any value in place of "n" as the no. of sides of polygon, and enter the radius of circle. Code will circumscribe the circl...
4 years 前 | 1 次下载 |
