how to create a jprogram that will find the greatest vcommon divisor??
skank111 0 Newbie Poster
kekkaishi 18 Junior Poster
you gotta try yourself first.
hint: you could use Euclid's gcd algorithm....
it goes like this,
gcd(a,b) = gcd(b, a%b)
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.