Analisis :
Suku ke-n dari deret tribonacci diperoleh dari rumus :
Tirbonacci(n) = tribonacci(n-3)+tribonacci(n-2)+tribonacci(n-1)
Dengan nilai awal untuk n = 1, n = 2, dan n = 3 berharga 1
Algoritma :
Fungsi tribonacci (input n : interger ) : integer
Deskripsi
If(n = 1) or ( n = 0 ) or ( n = 3 ) then tribonacci 1
else tribonacci tribonacci ( n – 1 ) + ( n – 2 ) + ( n – 3 )
end if
Bahasa c++
#include
#include
using namespace std;
class Operator {
friend ostream& operator <>(istream&, Operator&);
public:
long tribonacci(int);
private:
int n;
};
int tribonacci(int n){
if ((n == 1) || (n == 2) || (n == 3)) return (1);
else return(tribonacci(n-3)+tribonacci(n-2))+tribonacci(n-1);
}
ostream& operator <<(ostream& out, Operator& a){
for (int i = 1 ; i <=a.n; i++)
out <<tribonacci(i)<<” “;
out<>(istream& in ,Operator& a){
cout <>a.n;
return in;
}
int main () {
Operator run ;
cin >> run ;
cout << run;
return (EXIT_SUCCESS);
}