算法问题,找假币(轻)C++实现(如有错误请指出)
//找假币
#include<iostream>
using namespace std;
/*计算分组钱币总质量*/
int count(int a[],int begin,int end)
{
int sum = 0;
for (int i = begin; i <=end;i++)
{
sum += a[i];
}
return sum;
}
void find(int a[],int begin,int end)
{
int mid = (begin + end) / 2;
if(end-begin==1&&a[begin]>a[end]) //递归出口,end-begin代表只剩两个数(针对个数为偶数)
{
cout << "find no real money: " << end+1 << endl;