C++ Thinking recursively - No loops , i solved the first one i need help with the others

// Print a C++ string in reverse order void printReverseR(const char * p) { // See 2.3.1 of the textbook, page 57 return; }

void printForwardR(const char * p) { return; }

int combinations(int group, int members) { // Find the number of different combinations of group things taken members at a time return 0; }

int largestR(const int data[], int cellsUsed) { // Find the largest int in an array // See 2.4.3 of the textbook, page 72 return 0; }

int countCharR(const char * p, char lookFor) { // Count the number of times a char appears in a C++ string return 0; }

bool equalR(const char * left, const char * right) { // Are 2 C++ strings equal char by char return 0; }

bool smallerR(const char * left, const char * right) { // comparison of 2 C++ strings return 0; }

char largestR(const char * p) { // Find the largest char in a C++ string return '0'; }

int stringLengthR(const char * p) { // Find the lenght of a C++ string return 0; }