1.

Which of the following can be the base case for the recursive implementation used to find the length of a string?

A. if(string[len] == 1) return 1
B. if(string[len+1] == 1) return 1
C. if(string[len] == ‘\0’) return 0
D. if(string[len] == ‘\0’) return 1
Answer» C. if(string[len] == ‚Äö√Ñ√∂‚àö√ë‚àö‚â§\0‚Äö√Ñ√∂‚àö√ë‚àö¬•) return 0


Discussion

No Comment Found