9.关于排序和查找,以下说法正确的是A.冒泡排序算法中,数据的交换次数与比较次数一定相同B.选择排序算法中,若某一趟排序中数组元素没有发生过交换,则数组已有序C.有8个数据的数组,用顺序查找算法查找某个数,若查找不成功时,查找次数为9次D.有8个数据的有序数组,用二分查找算法查找某个数,最多的查找次数为4次10.有如下VB程序段:Dim a(1 To 5)As IntegerDim i As Integer,j as Integer,sum As Integeri 1:sum =0Do While i <=5a(i)=Int(Rnd 9)+1For j=i-1 To 1 Step -1sum sum a(j)Next iIf i>=2 And a(i)>sum Then i i-1sum =0i=i+1Loop执行该程序段后,a数组中个元素的值不可能的是A.7,5,6,3,3B.1,2,4,5,6C.1,1,1,3,6D.3,2,5,4,111.有如下VB程序段:Dim s As String,ch As String,i As Integer,t As Integers=Textl.Text t =0For i 1 To Len(s)ch Mid(s,i,1)If ch<""Then t=t *2 Val(ch)Text2.Text Text2.Text Str(t)Next i执行该程序,当文本框text1中输入了“10,11,”时,文本框text2中输出的是A.1213B.12511C.122133D.1225111112.某对分查找算法的VB程序段如下:i=1:j=10:c=0key Val(Text1.Text)Do While i