Data Structures and Algorithms Discussion Board
September 10, 2010, 02:34:43 PM *
Welcome, Guest. Please login or register.
Login with username, password and session length
News: Looking for a reliable webhosting provider? Read HostGator review to find 7 arguments in support of HostGator.
 
   Home   Help Search Login Register  
Data Structures and Algorithms Discussion Board > Data Structures, Algorithms, Java and C++ > Data Structures & Algorithms > iterative and stack based method
Pages: [1]
« previous next »
  Print  
Author Topic: iterative and stack based method  (Read 1403 times)
siti
Newbie
*

Rating: 0
Offline Offline

Posts: 2
« on: March 27, 2009, 01:00:02 AM »
Given two positive integers i and j, the greatest common divisor of i and j written gcd
(i, j) is the largest integer k such that (i % k = 0) and (j % k = 0).
Develop an iterative, stack based method that returns the greatest common divisor of
i and j.
« Last Edit: November 19, 2009, 07:15:13 AM by Algolist.net Editor » Logged
Algolist.net Editor
Administrator
Newbie
*****

Rating: 0
Offline Offline

Posts: 8
« Reply #1 on: March 27, 2009, 05:54:25 AM »
It's already being discussed here: iterative, stack based method [Urgent]
« Last Edit: November 21, 2009, 04:23:25 AM by Algolist.net Editor » Logged
Pages: [1]
  Print  
« previous next »
 
Jump to:  

 
Partners Ads        http://www.rapidsloth.com