Sambit Supriya Dash
Followers: 0 Following: 0
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.
2년 초과 전 | 다운로드 수: 1 |
제출됨
Greatest Common Divisor
The much improved version of GCD previous one uploaded.
2년 초과 전 | 다운로드 수: 1 |
제출됨
Greatest Common Divisor
Greatest number which could divide both the entered numbers fully (evenly).
2년 초과 전 | 다운로드 수: 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
거의 3년 전 | 다운로드 수: 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...
거의 3년 전 | 다운로드 수: 1 |