TIME COMPLEXITY:Time compexity is(roughly speaking) how the algorithm behaves as the input increases. Something with time complexity O(n) will take twice the time when the input doubles, something with time complexity O(N^2) will take four times longer when the input duobles and so on.
SPACE COMPLEXITY:Space complexity is the storage required for the execution of the algorithm. This includes all permanent and temporary storage required by the algoritm, including any necessary stakc allocations for recursions.
I have this problem which says, "A programmer can use the random feature to emulate the flipping of a coin. For example, if the generator produces a number 0 or 1, the value 0 can be assigned heads and the value 1 can be assigned tails.
Write a program that ...