单选题

下面代码实现了插入排序函数,则横线上应填写(    )。

void insertion_sort(vector<int> &nums) {

      for (int i = 1; i < nums.size(); i++) {

            ________________________________ { // 在此处填入代码

            while (j >= 0 && nums[j] > base)

                  nums[j + 1] = nums[j];

                  j--;

            }

            nums[j + 1] = base;

      }

}

A

int base = nums[i], j = i - 1;

B

int base = nums[i], j = i;

C

int base = nums[0], j = i - 1;

D

int base = nums[0], j = i;

赣ICP备20007335号-2