Suppose you have some List of S List of Strings called List and a String prefix. Write a method that removes all the Strings from list that begin with prefix. public void removePrefixStrings(List-String- list, String prefix) 7. What is the time complexity of this algorithm?

public void removePrefixStrings(List<String> list , String prefix) {

if(list==null || list.size()==0)

return;

for(int i=0; i<list.size();) {

if(list.get(i).startsWith(prefix))

list.remove(i);

else

++i;  

}  

}  

Time Complexity: If the prefix is the same as String length, Then finding all prefix match will take n *n = n2

Then removal is also n  

So the total time complexity is O(n3)

no backup memory

professionals can use many types of technology that can them. some examples are, computers (they research and can use for programs for data, they are also used for job applications, school work, and even to make new ideas), speedometers (can get data for unknown data), sometimes something as small as a pen (used for rough drafts, to insert data, and again job applications).