1.

PROGRAM:  Kalkulator  
1.1. ALGORITMA  
int kalkulator (int a, int b, char operasi)
{
int c;
switch (operasi)
{
case ‘+’ :
c = a + b;
break;

case ‘-’ :
c = a - b;
break;

case ‘*’ :
c = a * b;
break;

case ‘/’ :
c = a / b;
break;
}
return c;
}

1.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

int kalkulator (int a, int b, char operasi);

int main()
{
int a, b;
char operasi;
cout << endl;

cout << "Nilai a : ";

cin >> a;

cout << "Nilai b : ";

cin >> b;

cout << "Operator [ + ] [ - ] [ * ] [ / ] : ";

cin >> operasi;

cout << a << " " << operasi << " " << b << " = " << kalkulator (a, b, operasi) << endl;
cout << endl;
}

int kalkulator (int a, int b, char operasi)

{
int c;
switch (operasi)
{
case '+' :
c = a + b;
break;

case '-' :
c = a - b;
break;

case '*' :
c = a * b;
break;

case '/' :
c = a / b;
break;

default:
cout << "Error, bad input";
break;
}
return c;
}
2. PROGRAM:  Search  Data  (Array)  
2.1. ALGORITMA  
int searchdata (int data[], int cari)
{
int x;
for (int i = 0; i <= data.Length; i++)
{
if (data[i] == cari)
{
x = i;
break;
}
}
return x;
}

2.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

int searchdata (int data[], int datalength, int cari);

int main()
{
int cari;
int data[] = {2, 9, 0, 3, 5, 7, 4, 8, 9, 1, 6};
int datalength = sizeof (data) / sizeof(int);

cout << endl;

cout << "Angka yang dicari: ";
cin >> cari;

cout << "Data ditemukan pada indeks ke-" << searchdata (data, datalength, cari) << endl;
cout << endl;
}

int searchdata (int data[], int datalength, int cari)

{
int x;
for (int i = 0; i <= datalength; i++)
{
if (data[i] == cari)
{
x = i;
break;
}
}
return x;
}
3. PROGRAM:  Faktorial  
3.1. ALGORITMA  
int faktorial (int n)
{
int i = n;
int nilaifaktorial = i * (i – 1);

for (i = n-2; i > 0; i--)

{
nilaifaktorial *= 1;
}
return nilaifaktorial;
}

3.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

int faktorial (int n);

int main()
{
int n;

cout << endl;

cout << "Nilai n: ";
cin >> n;

cout << endl;

cout << "Deret: ";

for (int i = n; i > 0; i--)

{
cout << i;

if (i == 1)
{
cout << " = ";
}
else
{
cout << " * ";
}
}

cout << faktorial (n) << endl;

cout << endl;
}

int faktorial (int n)

{
int i = n;
int nilaifaktorial = i * (i - 1);

for (i = n-2; i > 0; i--)

{
nilaifaktorial *= i;
}
return nilaifaktorial;
}

 
4. PROGRAM:  Deret  Fibonacci  
4.1. ALGORITMA  
void fibonacci (int n)
{
int a = 0;
int b = 1;
int c;

cout << a;
cout << b;

for (int i = 3; i <= n; i++)

{
c = a + b;
a = b;
b = c;

cout << c;
}
}

4.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

void fibonacci (int n);

int main()
{
int n;

cout << endl;

cout << "Nilai Suku: ";
cin >> n;

cout << endl;

cout << "Deret Fibonacci: ";

fibonacci (n);

cout << endl;

}

void fibonacci (int n)

{
int a = 0;
int b = 1;
int c;

cout << a << " ";

cout << b << " ";

for (int i = 3; i <= n; i++)

{
c = a + b;
a = b;
b = c;

cout << c << " ";

}
cout << endl;
}

 
5. PROGRAM:  Deret  Bilangan  Genap  &  Bilangan  Ganjil  
5.1. ALGORITMA  
int faktorial (int n)
{
int i = n;
int nilaifaktorial = i * (i – 1);

for (i = n-2; i > 0; i--)

{
nilaifaktorial *= 1;
}
return nilaifaktorial;
}

5.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

int faktorial (int n);

int main()
{
int n;

cout << endl;

cout << "Nilai n: ";
cin >> n;

cout << endl;

cout << "Deret: ";

for (int i = n; i > 0; i--)

{
cout << i;

if (i == 1)
{
cout << " = ";
}
else
{
cout << " * ";
}
}

cout << faktorial (n) << endl;

cout << endl;
}

int faktorial (int n)

{
int i = n;
int nilaifaktorial = i * (i - 1);

for (i = n-2; i > 0; i--)

{
nilaifaktorial *= i;
}
return nilaifaktorial;
}

 
6. PROGRAM:  Mencari  Nilai  Kelipatan  Persekutuan  Terkecil  (KPK)  
6.1. ALGORITMA  
int carikpk (int a, int b)
{
int kpk = 0;

for (int i = 1; i < b; i++)

{
kpk = kpk + a;

if (kpk % 2 == b)
{
cout << “KPK Bilangan “ << a << “ dan ” << b << “ adalah “ << kpk;
break;
}
}
return kpk;
}

6.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

int carikpk (int a, int b);

int main()
{
int a, b, kpk;

cout << endl;

cout << "Bilangan 1: ";
cin >> a;

cout << "Bilangan 2: ";

cin >> b;

carikpk (a, b);

cout << endl;

cout << endl;
}

int carikpk (int a, int b)

{
int kpk = 0;

for (int i = 1; i <= b; i++)

{
kpk += a;

if (kpk % b == 0)
{
cout << "KPK Bilangan " << a << " dan " << b << " adalah " << kpk;
break;
}
}
return kpk;
}

 
7. PROGRAM:  Mencari  Nilai  Faktor  Persekutuan  Terbesar  (FPB)  
7.1. ALGORITMA  
int carifpb (int a, int b)
{
int c = a % b;

while (c != 0)
{
a = b;
b = c;
c = a % b;
}

cout << “Nilai FPB: “ << b;

return b;
}

7.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

int carifpb (int a, int b);

int main()
{
int a, b;

cout << endl;

cout << "Bilangan 1: ";
cin >> a;

cout << "Bilangan 2: ";

cin >> b;

carifpb (a, b);

cout << endl;

cout << endl;
}

int carifpb (int a, int b)

{
int c = a % b;

while (c != 0)
{
a = b;
b = c;
c = a % b;
}

cout << "Nilai FPB: " << b << endl;

return b;
}
8. PROGRAM:  Bubble  Sort  (Array)  
8.1. ALGORITMA  
void bubbleSort (int data[])
{
int i, j, temp;

for (i = 0; i < (data.Length – 1); i++)

{
for (j = 0; j < (data.Length – 1 – 1); j++)
{
if (data[j] > data[j+1])
{
temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
}
}
}
}

8.2. SOURCE  CODE  C++  

#include<iostream>

using namespace std;

void bubbleSort(int data[], int n);

int main()
{
int i;
int n = 5;
int data[5] = {30, 10, 50, 20, 40};
cout << endl;
cout << "Unsorted Array: " << endl;
for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
bubbleSort(data, n);
cout << endl;
}

void bubbleSort(int data[], int n)

{
int i,j,temp;
for(i = 0; i < n-1; i++)
{
for(j = 0; j < (n-1-i); j++)
{
if(data[j]>data[j+1])
{
temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
}
}
}
cout << endl;
cout << "Bubble Sort: " << endl;
for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
}

 
9. PROGRAM:  Selection  Sort  (Array)  
9.1. ALGORITMA  
void selectionSort (int data[])
{
int i, j, temp, small;

for (i = 0; i < (data.Length – 1); i++)

{
small = i;
for (j = i+1; j < data.Length; j++)
{
if (data[j] < data[small])
{
small = j;
}
}
if (small != i)
{
temp = data[i];
data[i] = data[small];
data[small] = temp;
}
}
}

9.2. SOURCE  CODE  C++  

#include<iostream>

using namespace std;

void selectionSort(int data[], int n);

int main()
{
int i;
int n = 5;
int data[5] = {30, 10, 50, 20, 40};
cout << endl;
cout << "Unsorted Array: " << endl;
for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
selectionSort(data, n);
cout << endl;
}

void selectionSort(int data[], int n)

{
int i, j, temp, small;
for(i = 0; i < n-1; i++)
{
small = i;
for(j = i+1; j < n; j++)
{
if(data[j] < data[small])
{
small = j;
}
}
if(small != i)
{
temp = data[i];
data[i] = data[small];
data[small] = temp;
}
}
cout << endl;
cout << "Selection Sort: " << endl;
for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
}
10. PROGRAM:  Insert  Sort  (Array)  
10.1. ALGORITMA  
void insertSort (int data[])
{
int i, j, temp;

for (i = 0; i < data.Length; i++)

{
for (j = i; j >= 1; j--)
{
if (data[j] < data[j-1])
{
temp = data[j];
data[j] = data[j-1];
data[j-1] = temp;
}
else
{
break;
}
}
}
}

10.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

void insertSort(int data[], int n);

int main()
{
int i;
int data[5] = {30, 10, 50, 20, 40};
int n = sizeof (data) / sizeof(int);

cout << endl;

cout << "Unsorted Array: " << endl;

for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
insertSort(data, n);
cout << endl;
}

void insertSort(int data[], int n)

{
int i, j, temp;

for (i = 1; i < n; i++)

{
for (j = i; j >= 1; j--)
{
if (data[j] < data[j-1])
{
temp = data[j];
data[j] = data[j-1];
data[j-1] = temp;
}
else
{
break;
}
}
}
cout << endl;
cout << "Insert Sort: " << endl;
for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
}
11. PROGRAM:  Quick  Sort  (Array)  
11.1. ALGORITMA  
void quickSort (int data[], int head, int tail)
{
if (head < tail)
{
int p = partition (data, head, tail);
quickSort (data, head, p-1);
quickSort (data, p+1, tail);
}
int i, j, temp;
}

int partition (int data[], int head, int tail)

{
int p = head;
int pivot = data[head];

for (int loc = head + 1; loc <= tail; loc++)

{
if (pivot > data[loc])
{
data[p] = data[loc];
data[loc] = data[p+1];
data[p+1] = pivot;

p = p + 1;
}
}
return p;
}

11.2. SOURCE  CODE  C++  

#include <iostream>

using namespace std;

void insertSort(int data[], int n);

int main()
{
int i;
int data[5] = {30, 10, 50, 20, 40};
int n = sizeof (data) / sizeof(int);

cout << endl;

cout << "Unsorted Array: " << endl;

for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
insertSort(data, n);
cout << endl;
}

void insertSort(int data[], int n)

{
int i, j, temp;

for (i = 1; i < n; i++)

{
for (j = i; j >= 1; j--)
{
if (data[j] < data[j-1])
{
temp = data[j];
data[j] = data[j-1];
data[j-1] = temp;
}
else
{
break;
}
}
}
cout << endl;
cout << "Insert Sort: " << endl;
for (i = 0; i < n; i++)
{
cout << "Element " << i << ": " << data[i] << endl;
}
}
12. PROGRAM:  Search  Data  (Array)  
13. PROGRAM:  Kalkulator  
14. PROGRAM:  Search  Data  (Array)  
15. PROGRAM:  Kalkulator  
16. PROGRAM:  Search  Data  (Array)