皮皮学，免费搜题
登录
搜题
【简答题】
已知线性表 (a 1 , a 2 , ... , a n ) 顺序存储,且每个元素都是均不相等的整数。下面算法用于将所有奇数移到所有偶数前边。算法思想是:从左到右找到偶数,从右到左找到奇数,将两者交换,循环这个过程直到遍历完整个顺序表为止,请填空完善之。 void move ( Sq List &L) { // 将 顺序表 L 中的所有奇数移动到所有偶数前边 i = 0; j = L.length-1; while( ) { while( L.elem[i]%2 == 0) i++ ; while( L.elem[i]%2 == 1) if( i < j ) { L.elem[i] ↔ L.elem[j]; } } }
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
反馈参考答案：
举一反三
【单选题】ou'd better _______all the lights are off before you go to bed.
A.
look through
B.
find out
C.
take care
D.
make sure
【单选题】Your company has an Active Directory domain that runs Windows Server 2008 The Sales OU contains an OU for Computers， an OU for Groups， and an OU for Users You perform nightly backups. An administrator...
A.
Perform an authoritative restore of the Sales OU.
B.
Perform an authoritative restore of the Groups OU.
C.
Perform a non-authoritative restore of the Groups OU.
D.
Perform a non-authoritative restore of the Sales OU.
相关题目：
参考解析：
知识点：
题目纠错 0
发布
