if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;
if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
if (last - first <= INSERTIONSORT_THRESHOLD) { if (1 < last - first) { trInsertionSort(isa, isaD, isaN, first, last); lsUpdateGroup(isa, first, last); } else if (last - first == 1) {
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;
break; trInsertionSort(isa, isaD, isaN, first, last); limit = -3; continue;