Вставка сортировки Дарт
// data structure
void insetionSort() {
int inside, outside;
nElems = list.length;
for (outside = 0; outside < nElems; outside++) {
int temp = list[outside];
inside = outside;
while (inside > 0 && temp < list[inside - 1]) {
list[inside] = list[inside - 1];
inside--;
}
list[inside] = temp;
}
}
Old-fashioned Okapi