generate all the strings of n bits in C

Question

1.00/5 (2 votes)

See more:

void binary(int n)

{

if(n < 1)
printf("%s\n",A); // Assume A is a global variable

else

{

A[n-1] = '0';

binary(n-1);

A[n-1] = '1';

binary(n-1);

}

}
Can anyone explain how the stack frames are generated for n=2?when n=2 i am getting only 00 and 11 but how are the remaining numbers i.e 10 and 01 generated?

Posted 29-Oct-15 5:26am

Sam Dean

Add a Solution

Comments

Sergey Alexandrovich Kryukov 29-Oct-15 12:07pm

What makes you thinking that this is related to stack frame? Stack frame is created when you call a function and exists before you return.
The idea to use recursion in this simple problem is plain insane. And you are not even trying to determine bit states. That is, you never use the value on n.
—SA

Sam Dean 29-Oct-15 13:00pm

this is recursion and recursion uses stack frame.So thats why i asked about stack frame

Richard MacCutchan 30-Oct-15 6:01am

Stack frames are generated the same way for every function call. The values of your variables are irrelevant. The way to identify what is happening in your code is to step through it with the debugger.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Alexandrovich Kryukov · Answer 1 · 2015-10-29T06:15:00

Please see my comment to the question.

I basically answered you about stack; will also add this: a function parameters are put on the stack, and they disappear with the frame when function returns. But of course, you need to learn seriously how stack, stack frames and calls work, this is one of the most fundamental basics of programming. But your question does not provide any adequate sample for the study of it, except the work "recursion", so there is nothing else to explain.

See also: https://en.wikipedia.org/wiki/Call_stack[^].

Now, your real problem is that you don't even try to use the value of n.

All you need to solve your problem is bitwise operators, and a loop:
https://en.wikipedia.org/wiki/Bitwise_operations_in_C[^],
http://www.cprogramming.com/tutorial/bitwise_operators.html[^].

—SA

Patrice T · Answer 2 · 2015-10-29T13:54:00

If you don't understand what is doing your code, the best is to see what it is doing with a debugger.
The debugger allow you to execute your code step by step and inspect variable as the code is executed.
You will see where and why your code is not doing what you expect.

Tour code fragment is not complete and we can't compile it to see what it is doing and why it fail.

generate all the strings of n bits in C

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0