public boolean isprefix(String s1, String s2) { int i = 0; if(s1.length > s2.length) return false; while(i < s1.length) { if(s1[i] != s2[i]) return false; i++; } return true; } Use the active operation approach and determine the exact number of times the active operation is executed in the worst case. Express your answer in terms of n, the length of the string s1. Hint: simplify your final answer as much as possible, and do not put spaces in your answer. Use juxtaposition for the multiplication operator, for example to write "nine times n" write "9n" not "9xn" or "9*n"; to write "four times (n+2)" write "4(n+2)", not "4x(n+2)" or "4*(n+2)".
public boolean isprefix(String s1, String s2) {
int i = 0;
if(s1.length > s2.length)
return false;
while(i < s1.length) {
if(s1[i] != s2[i])
return false;
i++;
}
return true;
}
Use the active operation approach and determine the exact number of times the active operation is executed in the worst case. Express your answer in terms of n, the length of the string s1.
Hint: simplify your final answer as much as possible, and do not put spaces in your answer. Use juxtaposition for the multiplication operator, for example to write "nine times n" write "9n" not "9xn" or "9*n"; to write "four times (n+2)" write "4(n+2)", not "4x(n+2)" or "4*(n+2)". Do not write your answer in Big-O notation. Write the exact number of lines executed.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
