Algorithms

(a)

Enter pseudocode for an iterative (no recursion allowed) algorithm for the chosen one

Problem.

(UPN) You should not use any additional data structures such as a stack. You can

assume that you are allowed to overwrite the input field

(b)

Use your pseudocode to determine the runtime complexity of the algorithm. Give them this

using Landau notation

(c)

Develop the C implementation for the given signature. Specifying a main ()

(d)

Give a C implementation using recursion.

Function and calling its function is not required.

The string functions ( #include ) of the C library must not be used

den , all other functions are allowed.

Problem variant PALI A palindrome is a string of characters that is read both forwards and backwards: next to. Otto, Etc. Develop a function, for a given string, the start and end position of the longest palindrome. The C signature is as follows: Interval * findLpalindrome (const char * input), where the data structure Interval is defined as follows: typedef struct int start; int end; } Interval; If the character string does not contain a palindrome, 0.0 should be added accordingly for start and end. be returned. Examples: findLpalindrom ("abcabccbacba") = {0. 11} findLPalindrom ("sfnebenabbaottoassrentner") = {18, 24} Problem variant PALI A palindrome is a string of characters that is read both forwards and backwards: next to. Otto, Etc. Develop a function, for a given string, the start and end position of the longest palindrome. The C signature is as follows: Interval * findLpalindrome (const char * input), where the data structure Interval is defined as follows: typedef struct int start; int end; } Interval; If the character string does not contain a palindrome, 0.0 should be added accordingly for start and end. be returned. Examples: findLpalindrom ("abcabccbacba") = {0. 11} findLPalindrom ("sfnebenabbaottoassrentner") = {18, 24}