Question

PLEASE I NEED C# PROGRAM WITH DETAILS

Objectives

• Apply recursion to a more difficult problem.

Background

There are many problems that loops simplify, such as displaying every pixel to a screen or receiving repetitive input. However, some situations that can be simplified with looping are not easily solvable using loops. This includes problems that require back tracking and being able to use information from previous iterations, which would normally be lost when using an iterative loop. In those cases, it is much easier to use recursion to logically solve the problem and it may even reduce the amount of code that needs to be written.

Tasks

This lab has two parts:

1. Write a recursive method that determines if a word is a palindrome.
2. Print out the results after testing your method on a few different strings.

Task 1 – Recursive Method

Create a recursive method, a method that calls itself, that returns true or false depending on whether or not a given string is a palindrome. A palindrome is a word that reads the same forwards and backwards, such as “tacocat”.

Task 2 – The Driver

            Now we just need to call our method from our Main method and test it with a few different inputs (they may be hardcoded or from user input). Print out the results of each of the method calls along with the string that it was searching through.

∃ Some Sample Output:

Received “tacocat” which is indeed a palindrome.

Received “lol” which is indeed a palindrome.

Received “haha” which is indeed a palindrome.

Received “catermelon” which is not a palindrome.

Answer 1

using System;

class Program
{
//method to print the output to a console which calls the method Palindrome
static void print_output(string input)
{
if(Palindrome(input))
{
Console.WriteLine("Recieved {0} which is indeed a Palindrome", input);
}
else
{
Console.WriteLine("Recieved {0} which is not a Palindrome", input);
}
}
//method to check whether a string is palindrome or not
static bool Palindrome(string input)
{
//if input length is less than or equal to 1 it is a palindrome
if(input.Length <= 1)
{
return true;
}
//check the first and last characters of the string
if(input[0] == input[input.Length - 1])
{
//check for the remaining string except the first and last characters
return Palindrome(input.Substring(1, input.Length - 2));
}
return false;
}
static void Main() {
//read the input from user and print the output
string input1 = Console.ReadLine();
print_output(input1);
string input2 = Console.ReadLine();
print_output(input2);
string input3 = Console.ReadLine();
print_output(input3);
string input4 = Console.ReadLine();
print_output(input4);
}
}

If you have any doubts please comment and please don't dislike.