void sort (vector & x, int last) { if (last > 0) { swap(x, index_of_max(x, last), last); sort(x, last - 1); } } void sort (vector & x, int last) { if (last > 0) { swap(x, index_of_max(x, last), last); sort(x, last - 1); } else { return; } } void sort (vector & x, int last) { vector lx, int llast; if (last > 0) { swap(x, index_of_max(x, last), last); lx = x; llast = last - 1; sort(x, last - 1); x = lx; last = llast; } else { return; } } void sort (vector & x, int last) { vector lx, int llast; while (true) { if (last > 0) { swap(x, index_of_max(x, last), last); lx = x; llast = last - 1; // sort(x, last - 1); x = lx; last = llast; } else { return; } } } void sort (vector & x, int last) { vector lx, int llast; while (last > 0) { swap(x, index_of_max(x, last), last); lx = x; llast = last - 1; x = lx; last = llast; } return; } void sort (vector & x, int last) { while (last > 0) { swap(x, index_of_max(x, last), last); last = last - 1; } }