1. 给一个有N个整数的数组S..和另一个整数X，判断S里有没有2个数的和为X，请设计成O（n*log2(n)）的算法。

1. 使用的是快速排序，加上两头夹逼来查找
   
2. #include <iostream>
   
3. using namespace std;
   
4. 
   
5.     void QuickSort(int*s,int low,int high)
   
6.     {
   
7. 
   
8.         int pivot_pos;
   
9.         int i;
   
10.         int j;
    
11. 
    
12.         //当low=high时递归退出
    
13.         if (low< high)
    
14.         {
    
15.             //首先确定一个基准数
    
16.             pivot_pos = s[low];
    
17.             i = low;
    
18.             j = high;
    
19. 
    
20.             //查找基准数
    
21.             while (i < j)
    
22.             {
    
23.                 //从后往前查找
    
24.                 while (i<j && s[j]>=pivot_pos)
    
25.                     j--;
    
26.                 if(i< j)
    
27.                 {
    
28.                     s[i]= s[j];
    
29.                     i++;
    
30.                 }
    
31.                 //从前往后查找
    
32.                 while (i<j && s[i]<pivot_pos)
    
33.                     i++;
    
34.                 if (i < j)
    
35.                 {
    
36.                     s[j]= s[i];
    
37.                     j--;
    
38.                 }
    
39.             }
    
40. 
    
41.             s[i]= pivot_pos;
    
42.             QuickSort(s,low,i-1);
    
43.             QuickSort(s,i+1,high);
    
44. 
    
45.         }
    
46. 
    
47.     }
    
48. 
    
49.     void find_pair(int*s,int n,int x)
    
50.     {
    
51.         int *begin=s;
    
52.         int *end=s+n-1;
    
53. 
    
54.         //俩头夹逼
    
55.         while(begin<end)
    
56.         {
    
57.             if(*begin+*end>x)
    
58.             {
    
59.                 end--;
    
60.             }
    
61.             else if(*begin+*end<x)
    
62.             {
    
63.                 begin++;
    
64.             }
    
65.             else
    
66.             {
    
67.                 cout <<*begin<<" "<<*end<<endl;
    
68.                 begin++;
    
69.                 end--;
    
70.             }
    
71.         }
    
72. 
    
73.         cout<<"No found!"<<" ";
    
74. 
    
75. 
    
76.     }
    
77. 
    
78.     int main()
    
79.     {
    
80.         int data[9]={8,3,5,8,9,1,2,4,4};
    
81. 
    
82.         QuickSort(data,0,8);
    
83. 
    
84.         int x;
    
85. 
    
86. 
    
87.         while(cin>> x)
    
88.         {
    
89.             find_pair(data,8,x);
    
90.         }
    
91. 
    
92. 
    
93.         return 0;
    
94.     }