function NaiveGCD(a, b)
Input: a, b (two positive integers)
Output: gcd(a, b) (the greatest common divisor of a and b)
while a ≠ b do
if a > b then
a ( a – b
else
b ( b – a
endif
endwhile
return(a)
end NaïveGCD
function EuclidGCD(a, b)
Input: a, b (two nonnegative integers)
Output: gcd(a, b) (the greatest common divisor of a and b)
while b ≠ 0 do
Remainder ( a mod b
a ( b
b ( Remainder
endwhile
|
~
¤
¦
А
В
2
X
ђ
¬
Ш
т
urn(a)
end EuclidGCD
function BabylonianSQRT(a, error)
Input: a (a positive number), error (a positive real number)
accurate to within error
x ( a
while |x - a/x| > error do
x ( (x + a/x)/2
endwhile
return(x)
end BabylonianSQRT
Computer Science Homework Solutions
#137255
Algorithms
Trace the action of the algorithm BabylonianSQRT for the following input values of a and error = 0.001:
a. a = 6
b. a = 23
c. a = 16
What is this?
By OTA - Overall OTA Rating
Debraj Banerjee, MIT (IP) - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
- Plain text response
- Attached file(s):
- Babylon.xls
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Algorithms - Trace the action of the algorithm NaiveGCD for the following input pairs. a. (24,108) b. (23,108) c. (89,144) d. (1953,1937) Exercise 1.8: Repeat Exercise 1.7 for the algorithm Eu ...
- Ambiguity in a proposed algorithm - Explain the distinction between an ambiguity in a proposed algorithm and an ambiguity in the representation of an algorithm.
- In what situation would you want to implement an array? How items in the array might be searched for or sorted. - In what situation would you implement an array? How items in the array might be searched for or sorted using different techniques. Covers Sequential & Binary Search; Selection Sort, Bubble Sort, Ind ...
- Algorithms - Data Structures and Algorithm Design - Given a linked list, create a linked list with the same elements but in the reverse direction.
- Writing queue and stack algorithms. - Using only the algorithms in the queue and stack ADT's, write an algorithm called reverseQueue that copies the contents of a queue to another queue, and reverses the order of the data. After data is c ...
