排序算法

排序算法

Problem 1

Given towo array \(A[1,\dots,n]\), and \(B[1,\dots n]\) containing \(n\) and \(n\) integers, respectively, compute the pair of values \(<A[i],B[j]>\) (one value in each array) with the closest values to a given in

[!TODO] 归并排序，堆排序，快速排序，锦标赛排序