3) Algorithm A3: substring (s, ip, len) 1. Initialize i = ip and count = 0 2. Use an array „dest‟ to hold the required substring 3. Repeat steps 4 ,5 and 6 while count

3) Algorithm A3: substring (s, ip, len)
1. Initialize i = ip and count = 0
2. Use an array „dest‟ to hold the required substring
3. Repeat steps 4 ,5 and 6 while count <>
4. dest[count] = s[i]
5. count = count +1
6. i = i + 1
7. Insert string terminator at end of dest
8. Exit
4) Algorithm A4: index(T, P)
1. Initialize i = 0 and max = t – p + 1 / * t and p are respectively lengths
of strings T and P * /
2. Repeat steps 3 to 6 while i <>
3. Repeat for j = 0 to p – 1
5. Return index i and exit
6. i = i + 1
7. Return –1 for no match
8. Exit
LAB TASKS
1. Implement the above algorithms in C/C++
2. Implement the above algorithms using functions.
3. Run your coding of Algorithm A1 with the following test case
 s = “Computer Programming is a prerequisite for Data Structures”
4. Run your coding of Algorithm A2 with the following test cases
 s1 = “But” and s2 = “ter”