1. Implement the recursive function is Palindrome developed in exercise 5, and use it in a program to check whether a given string is a palindrome or not.
2. Implement the Tower of Hanoi algorithm presented in this chapter for 4 disks using a recursive C++ program in such a way that the instructions for moving disks are displayed.
3. Implement the algorithm k Small , discussed in Section 2.4.4, as a C++ function. Use the fi rst value of the array as the pivot.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here