C++ Recursive Function

EddieOR™

2011-12-20 8:18 am

Write the complete function f2() which uses a recursive approach to perform the function f1() does.

int f2 ( int a[], int size, int current, int key)
{
// Your code for the answer should be inserted here.
}

#include <iostream>
using namespace std;

int f1 ( int a[], int size, int key)
{
int count = 0;
for ( int i = 0 ; i < size ; i++ )
{
if ( a[i] < key )
{
cout << a[i] << "/";
count++;
}
}

return count;
}

int main()
{
int result;
int a[4] = {6,8,7,3};
result = f1(a,4,7);
cout << endl;
cout << result << endl;
}

回答 (1)

garlic2010

2011-12-20 12:37 pm

✔ 最佳答案

int f2 ( int a[], int size, int current, int key)
{
int count = 0;
if ( current < size )
{
if ( a[current] < key )
{
cout << a[i] << "/";
count = 1;
}
count += f2(a, size, ++current, key)
}
return count;
}

int main()
{
int result;
int a[4] = {6,8,7,3};
result = f2(a,4,0,7);
cout << endl;
cout << result << endl;
}

2011-12-20 04:38:48 補充：
correction:
cout << a[i] << "/";
should be
cout << a[current] << "/";

👍 0 👎 0