Question
Consider the following recursive implementation used to convert a decimal number to its binary equivalent:
#includeint arr[31], len = 0;void recursive_dec_to_bin(int n){ if(n == 0 && len == 0) { arr[len++] = 0; return; } if(n == 0) return; __________; recursive_dec_to_bin(n/2);}int main(){ int n = 100,i; recursive_dec_to_bin(n); for(i=len-1; i>=0; i--) printf("%d",arr[i]); return 0;}Which of the following lines should be inserted to complete the above code?
#includeint arr[31], len = 0;void recursive_dec_to_bin(int n){ if(n == 0 && len == 0) { arr[len++] = 0; return; } if(n == 0) return; __________; recursive_dec_to_bin(n/2);}int main(){ int n = 100,i; recursive_dec_to_bin(n); for(i=len-1; i>=0; i--) printf("%d",arr[i]); return 0;}Which of the following lines should be inserted to complete the above code?
Answer: Option C
Was this answer helpful ?
The line "arr[len++] = n % 2 should be inserted to complete the above code.
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution