单项选择题
Items (58) and (59) are based on the following Pascal code. for i:=1 to n -1 do begin k:=i: for j :=i+1 to n do if A[j]<A[k] then k:=j: if k<>i then begin X:=A[k]; A[k]:=A[i]; A[i]:=x end; end;The sorting method described by the code is called
A.Insertion sort
B.Selection sort
C.Radix sort
D.Merge sort
点击查看答案
<上一题
目录
下一题>
热门
试题
单项选择题
D
点击查看答案
单项选择题
A
点击查看答案
相关试题
论述题1在多道程序环境中,进程数往往多于...
Software Engineering Economy is an ...