1．Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and
another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.)
#include<stdio.h>
#include<stdlib.h>
void merge(int arr[],int low,int mid,int high){
...
/dl/514507.html
标签：
c语言
算法
排序
上传时间：
2017-04-01
上传用户：糖儿水嘻嘻
