What is the Big-O running time of the following code that empty a list and explain...

Transcribed Image Text:

What is the Big-O running time of the following code that empty a list and explain your answer? [10 Points] If list1 implemented as ArrayList. b. If list1 implemented as Linked List. public static void empty (List<Integer> list1) { } a. Iterator<Integer> itrl = listl.iterator (); while (itrl.hasNext ()) { Integer x = itrl.next(); itrl.remove(); What is the Big-O running time of the following code that empty a list and explain your answer? [10 Points] If list1 implemented as ArrayList. b. If list1 implemented as Linked List. public static void empty (List<Integer> list1) { } a. Iterator<Integer> itrl = listl.iterator (); while (itrl.hasNext ()) { Integer x = itrl.next(); itrl.remove();

Answer rating: 100% (QA)

The image contains a Java method named empty that takes a List as a parameter and empties it using a... View the full answer