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

admin2009-02-24  18

问题 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;          A:=x      end;  end;The sorting method described by the code is called

选项 A、Insertion sort
B、Selection sort
C、Radix sort
D、Merge sort

答案B

解析
转载请注明原文地址:https://kaotiyun.com/show/p2NZ777K
0

最新回复(0)