//寻找和为定值的两个数:
#include<iostream>
using namespace std;
void insert_sort(int *s, int num)
{
int temp;
int j;
for (int i = 2; i <= num; i++)
{
temp = s[i];
j = i - 1;
while (s[j]>temp)
{
s[j + 1] = s[j];
j--;
}
s[j + 1] = temp;
}
}
void twosum(int *s, int length, int sum)
{
int begin = 0;
int end = length - 1;
while (begin<end)
{
long currsum = s[begin] + s[end];
if (currsum==sum)
{
cout << s[begin] << " " << s[end] << endl;
break;//作用是:只需任意一对即可。
}
else
{
if (currsum < sum)
{
begin++;
}
else
{
end--;
}
}
}
}
//测试函数:
int main()
{
int integer;
int s[] = { 12, 71, 56, 81, 45, 52, 32 };
int num = sizeof(s) / sizeof(s[0]);
insert_sort(s, num);
cout << "please enter the integer:\n";
cin >> integer;
twosum(s, num, integer);
return 0;
}
#include<iostream>
using namespace std;
void insert_sort(int *s, int num)
{
int temp;
int j;
for (int i = 2; i <= num; i++)
{
temp = s[i];
j = i - 1;
while (s[j]>temp)
{
s[j + 1] = s[j];
j--;
}
s[j + 1] = temp;
}
}
void twosum(int *s, int length, int sum)
{
int begin = 0;
int end = length - 1;
while (begin<end)
{
long currsum = s[begin] + s[end];
if (currsum==sum)
{
cout << s[begin] << " " << s[end] << endl;
break;//作用是:只需任意一对即可。
}
else
{
if (currsum < sum)
{
begin++;
}
else
{
end--;
}
}
}
}
//测试函数:
int main()
{
int integer;
int s[] = { 12, 71, 56, 81, 45, 52, 32 };
int num = sizeof(s) / sizeof(s[0]);
insert_sort(s, num);
cout << "please enter the integer:\n";
cin >> integer;
twosum(s, num, integer);
return 0;
}