问题详情

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请帮忙给出正确答案和分析，谢谢！