Consider the following recursive implementation used to reverse a string:
void recursive_reverse_string(char *s, int left, int right)
{
if(left < right)
{
char tmp = s[left];
s[left] = s[right];
s[right] = tmp;
_________;
}
}
Which of the following lines should be inserted to complete the above code?
void recursive_reverse_string(char *s, int left, int right)
{
if(left < right)
{
char tmp = s[left];
s[left] = s[right];
s[right] = tmp;
_________;
}
}A. recursive_reverse_string(s, left+1, right+1)
B. recursive_reverse_string(s, left-1, right-1)
C. recursive_reverse_string(s, left+1, right-1)
D. recursive_reverse_string(s, left-1, right+1)
Answer: Option C
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion