LAPORAN HASIL PRAKTEK ALGORITMA DAN PEMROGRAMAN II
Disusun oleh:
Anisyah jatu siti nurjanah
Teknik Informatika
16111036
PRODI TEKNIK INFORMATIKA DAN PRODI SISTEM INFORMASI
FAKULTAS TEKNOLOGI INFORMASI
BAB 1 VEKTOR ARRAY 1 D
INPUT DATA
#include<stdio.h>
#include<iostream>
using namespace std;
main()
{
int L[10];
int i;
{
for (i=0;i<10;i++)
{
printf("entry data: ",L[i]); scanf("%d",& L[i]);
}
printf("\n");
}
}
SCREEN HASIL
MEMBACA VEKTOR
#include<stdio.h>
#include<iostream>
using namespace std;
main()
{
int L[10]={1,2,3,4,5,6,7,8,9,10};
int i;
{
for (i=10;i<=9;i++)
{
}
printf("\n");
for(i=0; i<=9; i++)
{
printf("L[%d] =%d\n",i,L[i]);
printf("\n");
}
}
}
SCREEN HASIL
MENJUMLAHKAN ISI VEKTOR
#include <stdio.h>
main ()
{
int L[10]={1,2,3,4,5,6,7,8,9,10};
int i,sum;
sum=0;
{
for (i=10; i<10; i++)
{
printf("entry data: ", L[i]); scanf("%d",&L[i]);
}
printf ("\n");
{
printf("nilai L[%d] = %d",i,L[i]);
printf("\n");
}
for(i=0; i<10; i++)
sum=sum+L[i];
printf("jumlah issi vektor= %d \n", sum, i, L[i]);
}
printf ("\n");
}
CREEN HASIL
HITUNG RATA-RATA VEKTOR
#include <stdio.h>
main ()
{
int L[10]={1,2,3,4,5,6,7,8,9,10};
int i,sum;
sum=0;
int rata2;
{
for (i=10; i<=9; i++)
{
printf("entry data: ", L[i]); scanf("%d",&L[i]);
printf ("\n");
for(i=0; i<=9; i++)
{
printf("nilai L[%d] = %d",i,L[i]);
printf("\n");
}
for(i=0; i<=9; i++)
sum=sum+L[i];
printf("jumlah issi vektor= %d \n", sum, i, L[i]);
rata2=sum/10;
printf("nilai rata-rata isi vektor=%.i\n",rata2,i,L[i]);
}
}
SCREEN HASIL
BAB 2 MATRIK 2D
MEMASUKKAN DATA KE MATRIK 2D
#include<stdio.h>
main ()
{
int data [2] [5] [2] ;
int i,j,k;
for (i=0;i<2;i++)
for (j=0;j<10;j++)
{
printf ("data [%d] [%d] = ",i,j);
scanf("%d",&data[i][j]);
}
}
}
SCREEN HASIL
MEMBACA MATRIK 3D
#include<stdio.h>
main ()
{
int data [2] [10];
int i,j;
for (i=0;i<1;i++)
{
for (j=0;j<9;j++)
{
printf ("data [%d] [%d] = ",i,j);
scanf("%d",&data[i][j]);
}
}printf("\n\n");
{
for(j=0;j<9;j++)
{
printf("%d ",data[i][j]);
}printf("\n");
}
}
SCREEN HASIL
MENJUMLAHKAN ISI MATRIK 3D
#include<stdio.h>
main ()
{
int data [2] [10];
int i,j,jum;
for (i=0;i<1;i++)
{
for (j=0;j<9;j++)
{
printf ("data [%d] [%d] = ",i,j);
scanf("%d",&data[i][j]);
}
}printf("\n\n");
for(i=0;i<1;i++)
{
{
printf("%d ",data[i][j]);
}printf("\n");
}
for(i=0; i<1; i++)
{
for(j=0;j<9;j++)
{
jum= jum+data[i][j];
}
}
printf("jumlahnya =%d", jum);
}
SCREEN HASIL
RATA-RATA ISI MATRIK 3D
#include<stdio.h>
main ()
{
int data [2] [10];
int i,j,jum,rata;
for (i=0;i<1;i++)
{
for (j=0;j<9;j++)
{
scanf("%d",&data[i][j]);
}
}printf("\n\n");
for(i=0;i<1;i++)
{
for(j=0;j<9;j++)
{
printf("%d ",data[i][j]);
}printf("\n");
}
for(i=0; i<1; i++)
{
for(j=0;j<9;j++)
{
jum= jum+data[i][j];
}
}
for(i=0;i<=1;i++)
{
for(j=0;j<=9;j++)
{
rata=jum/20;
}
}
printf("jumlahnya = %d \n",jum);
printf("rata-rata = %i\n",rata);
SCREEN HASIL
BAB 3 MATRIK ARRAY 3D
MEMASUKKAN DATA KE MATRIK 3D
#include<stdio.h>
main()
{
int A [2][5][2];
int i,j,k;
for (i=0;i<2;i++)
{
for (j=0;j<5;j++)
{
for (k=0;k<2;k++)
{
printf("A[%d][%d][%d]=",i,j,k); scanf("%d",& A[i][j][k]);
}
}
}
SCREEN HASIL
MEMBACA MATRIK 3D
#include<stdio.h>
main()
{
int A [2][5][2],i,j,k,jum;
jum=0;
for(i=0;i<2;i++)
{
for(j=0;j<5;j++)
{
for(k=0;k<2;k++)
{
printf(" A [%d][%d][%d] = ",i,j,k);scanf("%d",& A [i][j][k]);
}
}
}
printf("\n\n");
{
for(j=0;j<5;j++)
{
for(k=0;k<2;k++)
{
printf(" %3d",A [i][j][k]);
}
}
printf("\n\n");
}
}
SCREEN HASIL
MENJUMLAHKAN ISI MATRIK 3D
#include<stdio.h>
main()
{
int data[2][2][5],i,j,k,jum;
for(i=0;i<2;i++)
{
printf("\n");
}
SCREEN HASIL
HITUNG RATA-RATA 3D
#include <stdio.h>
main()
{
int A [2] [5] [2];
int i, j, k;
float jumlah, ratarata;
for(i=0;i<2;i++)
{
for(j=0;j<5;j++)
{
for(k=0;k<2;k++)
{
printf("A[%d][%d][%d]=",i,j,k); scanf("%d",&A[i][j][k]);
}
}
printf("\n");
for(i=0;i<2;i++)
{
for(j=0;j<5;j++)
{
for(k=0;k<2;k++)
{
//printf("%d",A[i][j][k]);
printf("%d",A[i][j][k]);
printf("\n");
}
}
printf("---\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
for(k=0;k<5;k++)
{
jumlah=jumlah+A[i][j][k];
ratarata=jumlah/20;
}
}
}printf("jumlah=%.0f",jumlah);
printf("\n");
printf("ratarata=%0.2f",ratarata);
printf("\n");
}
SCREEN HASIL
BAB 4 SQUENTIAL SEARCH
IMPELEMENTASI
#include<stdio.h>
#include<stdlib.h>
int main()
{
int X[10] ={1,2,3,6,5,7,6,9,10,8};
int v,e,g;
e=0;
printf("masukkan angka yang ingin dicari = "); scanf("%d",&g);
for(v=0;v<10;v++)
{
if(X[v] ==g)
{
e=e+1;
}
}
{
printf("angka %d ditemukan, ada %d buah angka\n",g,e);
}
else
{
printf("angka tidak ditemukan\n");
}
printf("\n");
return 0;
}
SCREEN HASIL
BAB 5 BINARY SEARCH
IMPLEMENTASI BINARY
//*PROGRAM BINARY SEARCH
#include<stdio.h>
main()
{
int data [10]= {1,2,3,4,5,6,7,8,9,10};
int i,j,a,x,n=10, c=0;
printf ("\n masukkan nilai yang akan dicari= ");
scanf ("%d",& x);
i=0, j=a-1;
while (i>=j)
{
a= (i+j)/2;
{
c=1;
break;
}
else if (x>data[a])
{
i=a+1;
}
else
{
j=a-1;
}
}
if (c==0)
printf ("\n nilai tersebut tidak ditemukan \n",x);
else
printf ("\n nilai %d ditemukan \n",x);
return 0;
}
SCREEN HASIL
BAB 6 PENGURUTAN APUNG
IMPLEMENTASI BAHASA C
#include<stdio.h>
main()
{
for(i=0; i<10; i++)
{
for(k=9; k>i; k--)
{
if(L[k]<L[k-1])
{
temp=L[k];
L[k]=L[k-1];
L[k-1]=temp;
}
}
}
printf("data sudah terurut menjadi=\n");
for(i=0; i<10; i++)
{
printf("L[%d]=%d\n",i,L[i]);
}
}
SCREEN HASIL
BAB 7 PENGURUTAN METODE SELEKSI MAXIMUM DAN MINIMUM
IMPLEMENTASI SELEKSI MAXIMUM
#include<stdio.h>
int main()
int i,k,temp,imaks,maks,L[10]={1,3,2,4,6,5,8,7,9,10};
for(i=9;i>0;i--)
{
imaks=i;
maks=L[i];
for(k=0;k<i;k++)
{
if(L[k]<maks)
{
imaks=k;
maks=L[k];
}
}
temp=L[i];
L[i]=maks;
L[imaks]=temp;
}
for(i=0;i<10;i++)
printf("L[%d]=%d\n",i,L[i]);
}
SCREEN HASIL
IMPLEMENTASI MINIMUM
#include<stdio.h>
int main()
{
for(i=9;i>0;i--)
{
imin=i;
min=L[i];
for(k=0;k>i;k++)
{
if(L[k]<min)
{
imin=k;
min=L[k];
}
}
temp=L[i];
L[i]=min;
L[imin]=temp;
}
for(i=0;i<10;i++)
printf("L[%d]=%d\n",i,L[i]);
}
SCREEN HASIL
BAB 8 PENGURUTAN NAIK DAN MENURUN
IMPEMENTASI MENGURUTKAN DATA NAIK
#include<stdio.h>
{
//typedef enum { true=1,false=0 } boolean;
int i,k,j,L[10]={1,3,2,4,6,5,8,7,9,10};
int ketemu;
for (i=0;i<10;i++)
{
k=L[i];
j=i-1;
ketemu=0;
while ((j<=0) && (!ketemu))
{
if(k<L[j])
{
L[j+1]=L[j];
j=j-1;
}
else
{
ketemu=1;
}
}L[j+1]=k;
}
for (i=0;i<10;i++)
printf ("L[%d]=%d\n",i,L[i]);
SCREEN HASIL
IMPLEMENTASI MENURUN
#include<stdio.h>
main()
{
//typedef enum { true=1,false=0 } boolean;
int i,k,j,L[10]={1,3,2,4,6,5,8,7,9,10};
int ketemu;
for (i=0;i<10;i++)
{
k=L[i];
j=i-1;
ketemu=0;
while ((j>=0) && (!ketemu))
{
if(k>L[j])
{
L[j+1]=L[j];
j=j-1;
}
else
{
ketemu=1;
}
}
for (i=0;i<10;i++)
printf ("L[%d]=%d\n",i,L[i]);
}
SCREEN HASIL
BAB 9 PENGURUTAN METODE SHELL
IMPLEMENTASI
#include<stdio.h>
main()
{
int i,j,k,step,start,L[10]={1,3,2,4,6,5,8,7,9,10},ketemu;
step=9;
while(step>1)
{
step=step/3+1;
for(start=0;start<10;start++)
{
i=start+step;
while(i<=9)
{
k=L[i];
j=i-step;
ketemu=0;
{
if(k<L[j])
{
L[j+step]=L[j];
j=j-step;
} else
{
ketemu=1;
}
}L[j+step]=k;
i=i+step;
}
}
}
for(i=0;i<10;i++)
{
printf("L[%d]=%d\n",i,L[i]);
}
}
