Answer:
False
Explanation:
The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.
The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:
- If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
- If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
- Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
- Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
- Repeat the above steps again till R = 0.
The role of technology in efforts to explore space could be argued to say that it has helped us to discover many different planets. An IS is a space station that helps us do stuff!!
Answer:
#include<stdio.h>
//declare a named constant
#define MAX 50
int main()
{
//declare the array
int a[MAX],i;
//for loop to access the elements from user
for(i=0;i<MAX;i++)
{
printf("\n Enter a number to a[%d]",i+1);
scanf("%d",&a[i]);
}
//display the input elements
printf("\n The array elements are :");
for(i=0;i<=MAX;i++)
printf(" %d ",a[i]);
}
Explanation:
PSEUDOCODE INPUTARRAY(A[MAX])
REPEAT FOR I EQUALS TO 1 TO MAX
PRINT “Enter a number to A[I]”
READ A[I]
[END OF LOOP]
REPEAT FOR I EQUALS TO 1 TO MAX
PRINT A[I]
[END OF LOOP]
RETURN
ALGORITHM
ALGORITHM PRINTARRAY(A[MAX])
REPEAT FOR I<=1 TO MAX
PRINT “Enter a number”
INPUT A[I]
[END OF LOOP]
REPEAT FOR I<=1 TO MAX
PRINT A[I]
[END OF LOOP]
Hello there! The answer is:
B. The Pre-Production Phase
When someone or a group of people are designing an app or game, they generally follow the rule of phases. Basically, if you don't know what this process is, sound effects, character designs, icons and the concept are discussed. This is the first phase of game development.
I hope I helped you!
