Algoritma-6

Review Material

I -> P -> O

P= selection, looping, storage

Selection:

1. If
2. Else if
3. Else
4. Switch-case

Looping:

1. While
2. Do-while
3. For

Storage:

1. File in
2. SQL
3. No SQL

Contoh kodingan:

1. Segitiga pascal

#include <stdio.h>
int main()

{
int input;
int kol,bar,segitiga[100][100];
scanf(“%d”,&input);fflush(stdin);
for (baris=0;bar<input;bar++)
{
for (kol=0;kol<=bar;kol++)
{
if(kol==0 || kol==bar)
{
segitiga[bar][kol]=1;
}
else if(bar>1 && kol<bar)
{
segitiga[bar][kol]=segitiga[bar-1][kol]+segitiga[bar-1][kol-1];
}
printf(“%d “,segitiga[bar][kol]);
}
printf(“\n”);
}
return 0;
}

1. Bilangan prima

#include<stdio.h>
int main()
{

int a,b,i,c=0;

scanf(“%d”,&i);
fflush(stdin);
for(a=2;a<i+1;a++){
for(b=1;b<=a;b++)
{if(a%b==0){c++;}}

if (c==2)
{printf(“%d “,a);}c=0;}
getchar();
return 0;
}