safemalloc | A safe wrapper for alloc/free functions

You want all the possible (2^m) combinations of 0's and 1's taken m times in lexical order and you are using a 2D array to store the result. Things would be very easy if you just want to print all the possible combination of 0's and 1's instead of storing it in 2D array and printing array later.

Storing a combination of 0's and 1's to 2D array is a little bit tricky as every combination is one element of your 2D array. You want to generate the combination of 0's and 1's in accordance with the recursive algorithm. So, let's say, at some stage if your algorithm generates the combination 0010 which is stored in an element in 2D array. And the next combination would be 0011 which the recursive algorithm will generate just by changing the last number from 0 to 1 in the last combination (0010).

So, that means everytime when a combination is generated, you need to copy that combination to its successive location in 2D array. For e.g. if 0010 is stored at index 2 in 2D array before the algorithm starts computing the next combination, we need to do two things:

1. Copy the elements of index 2 to index 3
2. Increase the row number so that last combination will be intact

(Say, this is 2D array)

|0|0|0|0| index 0

|0|0|0|1| index 1

|0|0|1|0| index 2 ---> copy this to its successive location (i.e. at index 3)

|0|0|1|1| index 3 ---> Last combination (index 2) and the last digit is changed from 0 to 1

.....

.....

.....

This we need to do for after every combination generated. Now, I hope you got where you are making the mistake.

Few practice good to follow:

1. If you want to allocate memory as well as initialized it with 0, use calloc instead of malloc.

2. Any math function you are calling again and again for the same input, it's better to call it once and store the result in a variable and use that result where ever required.

3. Do not include any header file which is not required in your program.

4. Once done, make sure to free the dynamically allocated memory in your program.

I have made the corrections in your program: