For i = 1 To 7
k = 0
For j = 8 To i+1 Step -1
If a(j) <a (j-1) Then
t = a(j): a(j) = a(j-1): a(j-1) = t: k = 1
Next j
If k = 0 Then
Exit For
Next i
如果用上述算法对数据序列:38,11,21,62,59,65,77,79 进行排序(数据分别储存在数组元素 a(1)~a(8)中),执行程序后,数据的交换次数和比较次数分别为( )