edited by
683 views
0 votes
0 votes

We are given a C function, mystery() as follows.
 

void mystery(int m, int n)

{
    while(m<=n)
    {
        m++;
        n--;
    }
}

Let X be the number of times the comparission inside the while loop ( i.e., m<=n ) is performed, when mystery(127,255) is called.

Then the value of X is _______________

edited by

1 Answer

Related questions

0 votes
0 votes
0 answers
3
Vijay_Ram asked Jul 2, 2022
255 views
With in this less time I have to Complete many Subjects So,please tell me wether NP Hard& NP Complete concept in algorithm is there for gate or not?
1 votes
1 votes
1 answer
4
abhi1998 asked Sep 13, 2021
215 views
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same