Selection Sort

On each pass, selection sort scans the unsorted remainder for its smallest value, then swaps that value into the next position.

for (int i = 0; i < data.length - 1; i++) {
    int small = i;
    for (int j = i + 1; j < data.length; j++) {
        if (data[j] < data[small]) {
            small = j;
        }
    }
    if (small != i) {
        int keep = data[i];
        data[i] = data[small];
        data[small] = keep;
    }
}

Insertion Sort

On each pass, insertion sort takes the next element and slides it left, past every already-sorted element bigger than it, until it finds its place.

for (int i = 1; i < data.length; i++) {
    int key = data[i];
    int j = i - 1;
    while (j >= 0 && data[j] > key) {
        data[j + 1] = data[j];
        j = j - 1;
    }
    data[j + 1] = key;
}

The final line, placing key at data[j + 1] once the while loop stops, is not itself a counted shift: it is where the element ends up, not a move of an existing element.

Same Order, Different Work