Answer:
Stack
Explanation:
Any function that call itself can be regarded as recursive function, it should be noted that Recursion is a natural use for a stack, especially in the area of book keeping.
Recursion is very important because some of problems are usually recursive in nature such as Graph and others, and when dealing with recursion , only base and recursive case is needed to be defined.
Some areas where recursion is used are in sorting and searching.
I’m not sure how to answer that
Answer:
Argument
Explanation:
<u>Argument</u> - A set of connected ideas, supported by examples, made by a writer to prove or disprove a point.
You'll probably see numbers counting up, like 1 2 3 4 ...
Answer:
B and C
Explanation:
xPos and yPos determine the center of the circle, and rad determines the radius of the circle drawn.
It cannot be A because it starts drawing a circle with the center of (4, 1). None of the circles ahve a center at (4, 1). It is B because while it does start at (4, 1), the repeat function adds one to the y and radius. While ti repeats 3 times it ends up drawing all 3 circles. C also works because it starts by drawing the biggest circle and then subtracting the values to make the other two. It cannot be D because in the repeat function it subtracts from the y value and radius too early, it doesn't draw the biggest circle.
