摘要： 1.插入排序：procedure in_sort(var a: array of Integer; k, m: Integer);var p: Integer;begin p := 0; while p = 0 do begin if k >= a[m] then begin a[m + 1] := k; p := 1; end else begin a[m + 1] := a[m]; Dec(m); if m = -1 then begin a[m + 1] := k; ... 阅读全文