Question

CSC231 Discrete Structures Algorithms Attached to this assignment as a separate document is the C++ code for a program that determines if a given string is a palindrome or not. A palindrome is a word that is spelled the same backward or forward. "bob" is an example of a palindrome. The program is sometimes a talking point during lecture, and it may not fully adhere to the many bobisms I've been telling you about. In fact, it may not entirely work but that wasn't its purpose. Review the document and answer the following question. Compare and contract the complexity of the for loop on line 34 and while loop one lines 62-67. Then, determine the complexity of the entire isPalindrome (char *) function that begins on line 52 Type you answer in the space provided below.

Attached to this assignment as a separate document is the C++ code for a program that determines if a given string is a palindrome or not. A palindrome is a word that is spelled the same backward or forward. "bob" is an example of a palindrome. The program is sometimes a talking point during lecture, and may not fully adhere to the many bobisms I've been telling you about. In fact, it may not entirely work but that wasn't its purpose Review the document and answer the following question Compare and contract the complexity of the for loop on line 34 and while loop one lines 62-67. Then, determine the complexity of the entire ispalindrome (char*) function that begins on line 52. Type you answer in the space provided below.

Answer 1

Line 34 loop->

for count = 1 to the end of string (null character)

if string length is n, then complexity of this loop is O(n)

loop at line 62->

bos is pointer to start of string (assume it index 0 for simplicity)

eos is pointer to end of string (assume it index length-1 for simplicity)

In the worst case, while loop execute till bos<=eos

and in each iteration, bos increases by 1 and eos decreases by 1 which is as traversing string faster by 2 times

Complexity = O(length) for this loop

isPalindrome call stringLength which is O(n) and then line 62 while loop which is also O(n)

complexity = O(n) +O(n) = O(n)