Rewrite an alternate code that produces the same as the one presented below (you can only use recursion c++, no loops whatsoever). ```cpp// function for checking if a word is in the array dict[] or notbool findWord(string word, const string dict[], int top, int bot) { if (top > bot) { return false; // string is not found. } else { int mid = (top + bot) / 2; string check = dict[mid]; check[0] = tolower(check[0]); // making all words lowercase if (word.compare(check) == 0) { return true; } else if (word.compare(check) > 0) { return findWord(word, dict, top, mid - 1); } else if (word.compare(check) < 0) { return findWord(word, dict, mid + 1, bot); } } return true;}```### Explanation:This code is a C++ function designed to perform a binary search to determine if a specific word exists in a sorted array of strings, `dict[]`. The function, `findWord`, uses recursion to achieve this.- **Parameters:** - `word`: The string to be searched for. - `dict[]`: The array of strings to be searched. - `top`: The starting index for the search (initially set to the first index of the array). - `bot`: The ending index for the search (initially set to the last index of the array).- **Process:** 1. The function checks if `top` is greater than `bot`, returning `false` if true, meaning the word is not in the dictionary. 2. It calculates the midpoint of the current search range. 3. It retrieves and modifies the midpoint string by converting the first character to lowercase to standardize the comparison. 4. Using `compare`, it checks: - If `word` is equal to the middle word (`check`), it returns `true`. - If `word` is greater, it searches the left half of the array. - If `word` is smaller, it searches the right half of the array.This algorithm ensures efficient searching, suitable for large datasets, assuming `dict[]` is pre-sorted.

Here have to determine c++ code for alternative approach of problem.

Answered: Rewrite an alternate code that produces…

Engineering

Computer Engineering

Rewrite an alternate code that produces the same as the one presented below (you can only use recursion c++, no loops

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
Write a recursive methor called, doMyMath, which takes as input any positive integer and calculates the factorial.Javascript
Using recursion, let the user put an input and find all combinations that add upto given number. In c++ and explain each line of code.
Why would you use recursion instead of a loop? Is there anything that can be done using recursion that can't be done with a loop?
use The C Programming Language Online Compile for Recamán's Sequence Implement this in a program. Write two functions, one for solving it iteratively, one for solving it recursively. Take two arguments from the command-line: an "i" or "r", and the term number (how many terms to print). Print out which method executed (was selected) and all the terms (and the number of terms).
a. Prompt the user to type a word on console and save the input into variable b. Implement recursive method(s) isPalindrome() to check if the given word is a palindrome and call it from the main(). c. Implement recursive method(s) theLength() to calculate the length of the given word (its number of characters) d. Display your results on console in the following format: "You word palindrome." consists of_ characters, this a e. Explain in comments the algorithms you use (how the recursion works, where is the base case, there is the recursive call(s), how you reduce the problem complexity).
Please help Report - I/II. Do not copy other solutions. Please write your own words to avoid doing same with others.
write a recursive function that checks see if the first letter matches the last letter, return the middle letters and check until only 0 or 1 letters are left. It returns True or False. Here is python code that needs to be fixed # Returns the first character of the string str def firstCharacter(str): return str[:1] # Returns the last character of a string str def lastCharacter(str): return str[-1:] # Returns the string that results from removing the first # and last characters from str def middleCharacters(str): return str[1:-1] def isPalindrome(str): # base case #1 # base case #2 # recursive case pass def isPalindrome(string): reversedString = string[::-1] if reversedString == string: return True else: return False inputString = input() string = inputString.replace(" ", "") if isPalindrome(string): print(inputString,"is a palindrome") else: print(inputString,"is not a palindrome") if __name__ ==…