Sort Methods And Counting The Work

Max has a row of N boxes (1 <= N <= 1,000). Each box weighs some value W (1 <= W <= 10,000), which will be unique among all boxes. Max would like to sort his boxes from lightest to heaviest, and must decide between Insertion Sort and Selection Sort to do so. Moving a box any distance D requires (W * D) units of work. Max determine which of the two sorting methods will require the least work.

Both of the sort methods work and counting the work in the sequential sort works fine. For some reason that I can't figure out, I am not counting the insertion sort right.

import java.util.Arrays;
public class LeastWork {
import java.util.Arrays;
public class LeastWork {
public int leastWork(int[] boxes) {
int low;
int temp;
int sWork = 0;

[Code] .....