8000 Algorithms/Mathematics/GCD/C/gcd.c at dev · devel-hm/Algorithms · GitHub

Address: [go: up one dir, main page]

Include Form Remove Scripts Accept Cookies Show Images Show Referer Rotate13 Base64 Strip Meta Strip Title Session Cookies

Skip to content

Navigation Menu

All Features
- Learn & Connect
  Documentation
  Resource center
  Blog
  Events & webinars
  Community Forum
  Customer Stories
  Integrations
- Support
  Customer support
  Training
  GitHub Status
- Company
  About
  Partners
  Changelog
- GitHub Universe
  GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing

Appearance settings

You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session.

Dismiss alert

devel-hm
Algorithms

Repository navigation

Code
Pull requests
Actions
Projects
Security and quality
Insights

Breadcrumbs

Algorithms
Mathematics
GCD
C

/

gcd.c

Copy path

More file actions

More file actions

Latest commit

History

History

15 lines (12 loc) · 311 Bytes

Breadcrumbs

Algorithms
Mathematics
GCD
C

/

gcd.c

Copy path

File metadata and controls

15 lines (12 loc) · 311 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

#include<stdio.h>

int greatCommonDiv(int a, int b){ //used euclidian method to calculate gcd of two numbers

if(b==0){

return a;

}

return(greatCommonDiv(b , a%b));

}

int main(int argc, char const *argv[]) {

int result=greatCommonDiv(35,45);

printf("Greatest divider is: %d\n",result);

return 0;

}

Footer

© 2026 GitHub, Inc.

Footer navigation

Terms
Privacy
Security
Status
Community
Docs
Contact

You can’t perform that action at this time.

0