// sortStack runs for each of the n elements. // Each call pops one element and eventually reinserts it. // insert in the worst case may traverse the entire current stack to find the right place for ...