Question: Consider a recursive function findBinary() that prints every possible bit strings of every n-digit binary number that contains more zeros than ones. This function has
Consider a recursive function findBinary() that prints every possible bit strings of every n-digit binary number that contains more zeros than ones. This function has four parameters, one string, and three 32-bit integers as follow: findBinary(bitStr, n, ones, zeros).
For example:
findBinary("", 3, 0, 0)
"100"
"010"
"001"
"000"
What is the recursive relation of the function findBinary?
Question options:
|
|
T(n) = K + T(n-2) |
|
|
T(n) = K + T(n*2) |
|
|
None of the other answers are correct |
|
|
T(n) = K + T(n-1) + T(n-1) |
|
|
T(n) = K + T(n/2)
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
