Modul 15_16_1
//Recursive factorial function
#include<iostream>
using namespace std;
long faktorial(long);
void main(void)
{
for(int i=1;i<=10;i++)
cout<<i<<"! = "<<faktorial(i)<<endl;
}
long faktorial(long bil)
{
if(bil<=1)
return 1;
else
return(bil*faktorial(bil-1));
}
#include<iostream>
using namespace std;
long faktorial(long);
void main(void)
{
for(int i=1;i<=10;i++)
cout<<i<<"! = "<<faktorial(i)<<endl;
}
long faktorial(long bil)
{
if(bil<=1)
return 1;
else
return(bil*faktorial(bil-1));
}
Hasil outputnya :
Modul 15_16_2a
#include<iostream>
#define MAX_DATA 25
using namespace std;
void BacaData(int A[],int jml_dat);
void CetakData(int A[],int jml_dat);
float HitungRata(int A[],int jml_dat);
void main(void)
{
int A[MAX_DATA],jml_dat;
float RataRata;
cout<<"Jumlah data = ";cin>>jml_dat;
if(jml_dat<=MAX_DATA)
{
BacaData(A,jml_dat);
RataRata=HitungRata(A,jml_dat);
cout<<endl;
cout<<"Data yang anda masukan adalah :"<<endl;
CetakData(A,jml_dat);
cout<<endl;
cout<<"Rata-Rata = "<<RataRata<<endl;
}
else
cout<<"Data terlalu banyak, MAXIMUM = "<<MAX_DATA<<endl;
}
void BacaData(int A[],int jml_dat)
{
for(int i=0;i<=jml_dat-1;i++)
{
cout<<"Data["<<i<<"] = ";
cin>>A[i];
}
}
void CetakData(int A[],int jml_dat)
{
for(int i=0;i<=jml_dat-1;i++)
cout<<"Data["<<i<<"] = "<<A[i]<<endl;
}
float HitungRata(int A[],int jml_dat)
{
float SUM=0;
for(int i=0;i<=jml_dat-1;i++)
SUM=SUM+A[i];
return SUM/jml_dat;
}
*Coba kau masukan nilai 2,4 dan 5, maka :
Hasil outputnya :
Modul 15_16_3
#include<iostream>
#include<iomanip>
using namespace std;
void kali(int A[][3],int B[][3], int C[][3]);
void main(void)
{
int A[2][3]={2,3,2,
1,4,2};
int B[3][3]={3,2,1,
2,1,3,
4,1,2};
int C[2][3],i,j;
kali(A,B,C);
//cetak matrik A
cout<<"Matrik A : "<<endl;
for(i=0;i<=1;i++)
{
for(j=0;j<=2;j++)
cout<<setw(3)<<A[i][j]<<" ";
cout<<endl;
}
//cetak matrik B
cout<<"Matrik B : "<<endl;
for(i=0;i<=2;i++)
{
for(j=0;j<=2;j++)
cout<<setw(3)<<B[i][j]<<" ";
cout<<endl;
}
//Cetak matrik C
cout<<"Matrik C : "<<endl;
for(i=0;i<=2;i++)
{
for(j=0;j<=2;j++)
cout<<setw(3)<<C[i][j]<<" ";
cout<<endl;
}
}
void kali(int A[][3],int B[][3],int C[][3])
{
for(int i=0;i<=1;i++)
{
for(int k=0;k<=2;k++)
{
C[i][k]=0;
for(int j=0;j<=2;j++)
C[i][k]=C[i][k]+A[i][j]*B[j][k];
}
}
}
Hasil outputnya :
Modul 15_16_4
#include<iostream>
using namespace std;
int Fibo(int n);
void main(void)
{
int bil;
cout<<"Masukan Bilangan Bulat: ";
cin>>bil;
cout<<"Fibo("<<bil<<") = "<<Fibo(bil)<<endl;
}
int Fibo(int n)
{
if(n==0 || n==1)
return n;
else
return Fibo(n-1)+Fibo(n-2);
}
using namespace std;
int Fibo(int n);
void main(void)
{
int bil;
cout<<"Masukan Bilangan Bulat: ";
cin>>bil;
cout<<"Fibo("<<bil<<") = "<<Fibo(bil)<<endl;
}
int Fibo(int n)
{
if(n==0 || n==1)
return n;
else
return Fibo(n-1)+Fibo(n-2);
}
*Coba masukan bilangan bulat seperti 2
Hasil outputnya :
Modul 15_16_5
using namespace std;
int max(int,int,int);
void main1(void)
{
int a,b,c;
cout<<"Masukan Bilangan ke-1 = ";cin>>a;
cout<<"Masukan Bilangan ke-2 = ";cin>>b;
cout<<"Masukan Bilangan ke-3 = ";cin>>c;
cout<<endl;
cout<<"Bilangan Terbesar = "<<max(a,b,c)<<endl;
}
int max(int x, int y, int z)
{
int maximum=x;
if(y>maximum)maximum=y;
if(z>maximum)maximum=z;
return maximum;
}
*Coba Masukan nilai 2,3,4, maka :
Hasil outputnya :
No comments:
Post a Comment