The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
66 views

The below question is based on the following program. In the program, we assume that integer division returns only the quotient. For example 7/3 returns 2 since 2 is the quotient and 1 is the remainder.

mystery(a,b){
        if (b == 0) return a;
        if (a < b) return mystery(b,a);
        if (eo(a,b) == 0){
             return(2*mystery(a/2,b/2));
    }
    if (eo(a,b) == 1){
        return(mystery(a,b/2));
    }
    if (eo(a,b) == 2){
        return(mystery(a/2,b));
    }
    if (eo(a,b) == 3){
        return (mystery((a-b)/2,b));
    }
}
eo(a,b){
if ((a/2)*2 == a and (b/2)*2 == b) return 0; end;
if ((a/2)*2 < a and (b/2)*2 == b) return 1; end;
if ((a/2)*2 == a and (b/2)*2 < b) return 2; end;
return 3;
}

When $a$ and $b$ are $n$ bit positive numbers the number of recursive calls to $mystery$ on input $a,\: b$ is

  1. $O(n)$
  2. $O(log log n)$
  3. $O(log n)
  4. $O(n^{\frac{1}{2})$
in Algorithms by Veteran (100k points) | 66 views

1 Answer

0 votes
O(log n)
by Loyal (9.6k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,092 questions
55,237 answers
190,755 comments
85,990 users