Time complexity and Big-O notation in Java !!

1. The sum_getImple Method

/** * Get the total of the values in an integer list * @param nums The list of integers * @return The sum of the values */ public int sum_getImple(java.util.List nums) { int total = 0; for(int i = 0; i < nums.size(); i++) { total += nums.get(i); } return total; }

I'm really confused how to define which one is the right one for each method. Please help

When nums is an ArrayList, the sum_getImple method is what: O(N),linear time. O(1) constant time, or O(N^2) quadratic time ?

When nums is a LinkedList, the sum_getImple method is what: O(N), linear time. O(1) constant time, or O(N^2) quadratic time?

=================================================

2. The sum_iteratorImple Method

/** * Get the total of the values in an integer list * @param nums The list of integers * @return The sum of the values */ public int sum_iteratorImple(java.util.List nums) { int total = 0; java.util.Iterator it = nums.iterator(); while(it.hasNext()) { total += it.next(); } return total; }

When nums is an ArrayList, the sum_iteratorImple method is what ? O(N), linear time. O(1) constant time, or O(N^2) quadratic time? When nums is an LinkedList, the sum_iteratorImple method is what ?

==============================================

3. The removeEvens_getImple Method

/** * Remove the even values from a list of integers. * The method modifies the parameter list. * @param nums The list of integers */ public void removeEvens_getImple(java.util.List nums) { for(int i = 0; i < nums.size(); i++) { if(nums.get(i) % 2 == 0) { nums.remove(i); } } }

When nums is an ArrayList, the removeEvens_getImple method is O(? When nums is an LinkedList, the removeEvens_getImple method is O(?

============================================

4. The removeEvens_iteratorImple Method

/** * Remove the even values from a list of integers. * The method modifies the parameter list. * @param nums The list of integers */ public void removeEvens_iteratorImple(java.util.List nums) { java.util.Iterator it = nums.iterator(); while(it.hasNext()) { int value = it.next(); if(value % 2 == 0) { it.remove(); } } }

When nums is an ArrayList, the removeEvens_iteratorImple method is O(? When nums is an LinkedList, the removeEvens_iteratorImple method is O(?

=================================================

5. The double_getImple Method

/** * Double the values in a list of integers. * This method modifies the parameter list. * @param nums The list of integers */ public void double_getImple(java.util.List nums) { for(int i = 0; i < nums.size(); i++) { int value = nums.get(i); nums.set(i, 2 * value); } }

When nums is an ArrayList, The double_getImple Method is O(? When nums is an LinkedList, The double_getImple Method is O(?

===================================================

6. The double_iteratorImple Method

/** * Double the values in a list of integers. * This method modifies the parameter list. * @param nums The list of integers */ public void double_iteratorImple(java.util.List nums) { java.util.ListIterator it = nums.listIterator(); while(it.hasNext()) { int value = it.next(); it.set(2 * value); } }

When nums is an ArrayList, The double_iteratorImple Method is O(? When nums is an LinkedList, The double_iteratorImple Method is O(?