returns the Greatest Common Divisor of two integers
What will be an ideal response?
```
int gcd( int num1, int num2 )
{
int divisor;
int dividend;
int remainder;
divisor = abs( num1 );
dividend = abs( num2 );
for ( remainder = dividend % divisor;
remainder != 0;
remainder = dividend % divisor ) {
dividend = divisor;
divisor = remainder;
}
return divisor;
}
```
You might also like to view...
For the array that was the correct answer in the previous question, what is the value returned by items[1][0]?
a. 4. b. 8. c. 12. d. 6.
When you click in the Search field, the words "Search in Document" appear and the Search field becomes active.
Answer the following statement true (T) or false (F)
Which command is used to resave frequently used text and then insert the saved text as needed in other documents?
A. Bookmark B. Template C. Text box D. Quick Parts
In which of the following scenarios would it be preferable to implement file level encryption instead of whole disk encryption?
A. A server environment where the primary security concern is integrity and not file recovery B. A cloud storage environment where multiple customers use the same hardware but possess different encryption keys C. A SQL environment where multiple customers access the same database D. A large datacenter environment where each customer users dedicated hardware resources