• 2022-06-15
    理解下面算法,并补充完整。[br][/br] //算法功能:(1) public void insertSort() { int temp, position; for (int i = 1; i [ length; (2) ) { temp = record[i]; for (position = i; position ] 0 && temp < record[position -1]; (3) ) { record[position] = record[position - 1]; } record[position] = (4) ; } }[/i]
  • 举一反三