After entering the loop, it should use the correct list size and the loop will be affected if the remove call changes the size of the list.
If lst is an Arraylist the running time of removefirsthalf is O (n^2). So when the beginning is removed the next element will move forward.
If lst is a LinkedList which is a dynamic structure the running is O (n) for removefirsthalf
