Java question

The following example displays the advantage of a Lists basic positional access operations. This polymorphic algorithm example swaps two elements in any List, regardless of its implementation type.

public static void swap(List a, int i, int j) { E tmp = a.get(i); a.set(i, a.get(j)); a.set(j, tmp); }

How does this affect performance and what can you to remedy it?