Beruflich Dokumente
Kultur Dokumente
Source
Code C++
Part I
Persegi
Ajaib,Segitiga,Binary
Search
Tree,Faktorial,bilang
an
Fibonacci,Penjumlah
an Deret
Kuadrat,Bubble
Sort,Strev
http://scribd.com/winmuham
mad
http://twitter.com/winmuha
mmad
http://facebook.com/winmu
hammad
1. Persegi Ajaib
#include<stdio.h>
#include<conio.h>
void main() {
int kolom,baris,n,spasi;
do {
clrscr();
gotoxy(15,2); printf("Program Persegi Ajaib Punyaku");
gotoxy(3,5);
printf("Masukkan Panjang Sisi : "); scanf("%d",&n);
gotoxy(3,7); printf("Persegi dengan panjang sisi %d\n\n",n);
for(baris=1;baris<=n;baris++)
{ printf("* "); }
printf("\n");
for(kolom=1;kolom<=n-2;kolom++)
{ printf("*");
for(spasi=1;spasi<=n*2-3;spasi++)
{ printf(" "); }
printf("*\n");
}
for(baris=1;baris<=n;baris++)
{
printf("* ");
}
gotoxy(3,23); printf("tekan tombol \"y\" untuk mengulang");
gotoxy(3,24); printf("tekan sembarang tombol untuk keluar");
}
while(getch()=='y');
}
2. Segitiga
#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
float a,t,r,K,L;
scanf("%f%f",&a,&t);
r=sqrt(a*a+t*t);
http://scribd.com/winmuhammad 2
K=a+r+t;
L=(a*t)/2;
getch();
}
#include <stdio.h>
#include <conio.h>
#include <malloc.h>
struct data{
int angka;
struct data *left, *right;
}*root = NULL;
void menu(void){
gotoxy(1,23); printf("+ to insert");
gotoxy(40,23); printf("- to seek and destroy");
gotoxy(1,24); printf("Esc to Exit");
}
http://scribd.com/winmuhammad 3
clearall(p -> left);
clearall(p -> right);
free(p);
}
void print_order(void){
gotoxy(1,19); printf("PreOrder : "); preorder(root);
gotoxy(1,20); printf("InOrder : "); inorder(root);
gotoxy(1,21); printf("PostOrder : "); postorder(root);
}
http://scribd.com/winmuhammad 4
seekndestroy( p -> left, angka);
}
}
else if( angka > p -> angka){
if( p -> right -> angka == angka){
clearall (p -> right);
p -> right = NULL;
}
else{
seekndestroy( p -> right, angka);
}
}
}
void main(){
int tekan, angka;
do{
clrscr();
menu();
cetak(root, 40, 2, 20);
print_order();
tekan = getch();
switch(tekan){
case '+' : gotoxy(1,16); printf("Masukkan Angka : ");
scanf("%d",&angka);
insert(&root, angka,0);
break;
http://scribd.com/winmuhammad 5
4. Faktorial
#include<stdio.h>
#include<conio.h>
long faktor(int n)
{
if(n==0)return 1;
else return n*faktor(n-1);
}
void main()
{
int n;
printf("masukkan n : ");
scanf("%d",&n);
printf("n faktorial=%d ",faktor(n));
getch();
}
5. Bilangan Fibonacci
#include<stdio.h>
#include<conio.h>
int fib(int n)
{
int f;
if (n==0)f=0;
else if(n==1)f=1;
else f=fib(n-2)+fib(n-1);
return f;
void main()
{
int n;
printf("masukkan n: ");
scanf("%d",&n);
getch();
}
http://scribd.com/winmuhammad 6
6. Penjumlahan Deret Kuadrat
#include<stdio.h>
#include<conio.h>
int jumlah(int n)
{
if(n==1)return 1;
else return (n*n)+jumlah(n-1);
void main()
{
int n,i;
printf("n= ");
scanf("%d",&n);
i=jumlah(n);
printf("%d jumlah= %d",n,i);
getch();
}
7. Bubble Sort
#include<stdio.h>
#include<conio.h>
void main(){
int bil[5]={5,3,2,1,4};
int j,i,temp;
for(i=0;i<5;i++)
scanf("%d",&bil[i]);
for(j=0;j<4;j++)
{for(i=0;i<4-j;i++)
{if(bil[i]>bil[i+1])
{temp=bil[i];
bil[i]=bil[i+1];
bil[i+1]=temp;
}
}
}
for(i=0;i<5;i++)
printf("%d ",bil[i]);
getch();
}
8. Membalikkan Kata
#include<stdio.h>
http://scribd.com/winmuhammad 7
#include<conio.h>
#include<string.h>
#include<stdlib.h>
void main()
{
char a[10];
strrev(a);
getch();
}
http://scribd.com/winmuhammad 8