皮皮学，免费搜题
登录
搜题
【单选题】
试以L.r[k+1]作为监视哨改写教科书10.2.1节中给出的直接插入排序算法。其中,L.r[1..k]为待排序记录且k =1; --i ) { if (L.r[i+1].key < L.r[i].key) { L.r[k+1] = L.r[i]; // 复制为监视哨for ( j=i+1; L.r[k+1].key > L.r[j].key; ++ j )L.r[j-1] = L.r[j]; // 记录前移}//end if C }//end for } // InsertSortA.
L.r[j+1] = L.r[k+1]
B.
L.r[j] = L.r[k]
C.
L.r[j] = L.r[k+1]
D.
L.r[i] = L.r[k+1]
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
反馈参考答案：
举一反三
【单选题】The firm has a very good news ______.
A.
staffs
B.
department
C.
employees
D.
members
【简答题】It gives me great pleasure today to say a few words in praise of a man we will all miss very much. To be honest, I can’t imagine we will do without him when he’s gone. Bill s almost single–hande...
【简答题】The
firm has a very good sales ________.A. staffs B. department C. employees D. members
相关题目：
参考解析：
知识点：
题目纠错 0
发布
