Question: Euclidean algorithm? What is the greatest number of steps in the  Euclidean algorithm for the numbers 13,405 and 1,027?\n\nA) 15\n\nB) 20\n\nC) 25\n\nD) None of the above

Answer: D\n\nthis is kind of a silly question -- the true number of steps is 3\n13405 / 1027\n 1027 /   54\n   54 /    1\n    1 /    0\n\ntechnically speaking, the euclidean algorithm is O(n) where n is # of digits in the input.
This question from the Yahoo Q&A forum is categorized in the topic: Computers & Internet