program kalkulator sederhana dengan c++

#include <iostream>
#include <conio.h>
#include <math.h>

using namespace std;
class calculator
{
private:
float angka_1,angka_2,hasil;
char operasi,eksekusi;
public:
void masukan ();
void proses ();
void keluaran ();
};

void calculator::masukan ()
{
cout<<"Masukkan Angka pertama = "; cin>>angka_1;
cout<<"Jenis Operasi perhitungan * / + - = "; cin>>operasi;
cout<<"Masukkan Angka kedua = ";
cin>>angka_2;
}

void calculator::proses ()
{
if(operasi=='*')
{
hasil=angka_1*angka_2;
}
else if(operasi=='/')
{
hasil=angka_1/angka_2;
}
else if(operasi=='+')
{
hasil=angka_1+angka_2;
}
else if(operasi=='-')
{
hasil=angka_1-angka_2;
}
}

void calculator::keluaran()
{
cout<<"Tekan tombol (=) ";
do {
     cin>>eksekusi;
     if(eksekusi=='=')
     {
      cout<<"Hasil perhitungan = " << hasil << endl;
     }
     else
          cout<<"Anda tidak menekan tombol sama dengan (=) ";
    
     }while(eksekusi!='='); }
    
int main() {
    class calculator jadi; char pil; do { ;
    jadi.masukan(); jadi.proses(); jadi.keluaran(); cout<<"Apakah anda ingin mengulang? (y or n) ";
  cin>>pil;
}while(pil=='y'||pil=='Y');
//}
   

    system("PAUSE");
    return EXIT_SUCCESS;
}

menghitung tahun kabisat dengan c++

#include <cstdlib>
#include <iostream>

using namespace std;
class tahun_kabisat{
      friend istream& operator>>(istream&,tahun_kabisat&);
      private:
            unsigned int bil;
           
      public:
            void kabisat();
}; 
istream& operator>>(istream& in,tahun_kabisat& x) {
         cout<<"Masukkan bilangan=";
         in>>x.bil;
         return in;
         }
        
 void tahun_kabisat :: kabisat(){  
   if(bil % 4 == 0){
       cout<<"ya tahun kabisat.\n";
       }
   else
       cout<<" bukan kabisat.\n";
      
   cout<<bil;
      
}
int main(int argc, char *argv[])
{
 
    cout << "mencari tahun kabisat"<<endl;
  
    tahun_kabisat X;
    cin>>X;
    X.kabisat();
  
   cout<<endl;
   
    system("PAUSE");
    return EXIT_SUCCESS;
}

mencari titik tengah dengan c++

Masalah:
Mencari titik tengah dari dua titik koordinat. Dengan menghitung jarak antara dua titik dan menampilkan hasil perhitungan tersebut.

Analisis:
Memasukkan nilai x untuk kedua titik dan nilai y untuk kedua titik. Kemudian menghitungnya menggunakan rumus.

Data requitment:
masalah input
x1, x2, y1, y2
masalah output
titik tengah
rumus yang digunakan
titik tengah x = (x1+x2)/2
titik tengah y = (y1+y2)/2
titik tengah = titik tengah x, titik tengah y

Design:
Setelah mengidentifikasi masalah input output, maka langkah-langkahnya sebagai berikut:
1. Masukkan nilai x1, x2
2. Masukkan nilai y1, y2
3. Hitung titik tengahnya
4. Tampilkan hasilnya

Implementasi:
#include <iostream.h>
#include <conio.h>
class Titik{
   friend istream& operator>>(istream& ,Titik&);
   friend ostream& operator<<(ostream& ,Titik&);
public:
Titik(){};
float titik1();
float titik2();
private:
float x1, x2;
float y1, y2;
float TitikTengahx;
float TitikTengahy;
};
float Titik :: titik1(){
                TitikTengahx=(x1+x2)/2;
      return TitikTengahx;
      }
float Titik :: titik2(){
      TitikTengahy=(y1+y2)/2;
      return TitikTengahy;
      }
istream& operator>>(istream& masuk, Titik& M){
   cout<<"PROGRAM MENGHITUNG TITIK TENGAH"<<endl;
   cout<<"masukkan nilai x1 dan x2 : ";
   masuk>>M.x1>>M.x2;
   cout<<"masukkan nilai y1 dan y2 : ";
   masuk>>M.y1>>M.y2;
   return masuk;
   }
ostream& operator<<(ostream& keluar, Titik& M){
   keluar<<"titik tengahnya adalah :("<<M.titik1()<<" , "<<M.titik2()<<")";
   return keluar;
   }
void main(){
        Titik Mochtar;
   cin>>Mochtar;
   cout<<Mochtar;
   getch();
   }

Hasil test:
PROGRAM MENGHITUNG TITIK TENGAH
masukan nilai x1 =
masukan nilai x2 =
5
4
masukan nilai y1 =
masukan nillai y2 =
2
6
titik nilai tengah adalah :<4.5 , 4>

rekursif dan iteratif dalam bentuk java

import jeliot.io.*;
import java.util.Scanner;

public class MyClass {
    public static void main() {
    rumus tes = new rumus();
    tes.masukan();
    tes.kluaran();

     return 0;
     }
}

public class rumus
{
public final void masukan()
{
System.out.print("program menghitung rumus : 1-(1/2)+(1/3)-(1/4)+...+(1/n)");
System.out.print("\n");
System.out.print("\n");
System.out.print("masukkan nilai a : ");
a = Input.nextInt();
jumlah =0;
total =0;
rumus =-1;
}
public final void kluaran()
{
for(int j =1; j<=a; j++)
{
rumus =(rumus*(-1));
total =rumus/j;
jumlah+=total;
if(j ==1)
{
System.out.print("(");
System.out.print(total);
System.out.print(")");
}
if(j>1)
{
System.out.print("+(");
System.out.print(total);
System.out.print(")");
}
}

System.out.print("\n");
System.out.print("\n");
System.out.print("hasilnya : ");
System.out.print(jumlah);
}

private int a;
private double rumus;
private double jumlah;
private double total;
}

SORTING

buble sorting

#include <cstdlib>
#include <iostream>

using namespace std;

int baca_data(int A[],int n){
    int i;
    for(i=0;i<n;i++)
    {
                    cout<<"data ke-"<<i+1<<":";
                    cin>>A[i];
                    }
                    }
                    int cetak_data(const int A[],int n){
                        int i;
                        for(i=0;i<n;i++)
                        cout << A[i] << "";
                        cout << "\n";
                        }
                        int tukar(int *a,int *b)
                        { int temp;
                        temp= *a;
                        *a = *b;
                        *b = temp;
                        }
                        int buble_sort(int x[],int n)
                        {
                       
                        int i,j;
                        for(i = 0; i<n-1; i++)
                        for(j=i+1; j<n;j++)
                        if(x[i] > x[j]) tukar (&x[i],&x[j]);
                        }
                       
int main()
{
    int data[10],n;
    cout << "banyak data:";
    cin >> n;
    baca_data(data,n);
    cetak_data(data,n);
    buble_sort(data,n);
    cetak_data(data,n);

    system("PAUSE");
    return EXIT_SUCCESS;
}


insertion sorting

#include <cstdlib>
#include <iostream>
#include <conio.h>

using namespace std;

class Sorting{
      friend istream& operator >> (istream& in,Sorting& a);
      friend ostream& operator << (ostream& out,Sorting& a);
      public:
             void baca_data();
             void cetak_data();
             void buble_sort();
             void insertion_sort();
             void selection_sort();
             private:
                     void minimum(int, int,int&);
                     void tukar(int&,int&);
                     int data[10],n;
                     };
                     istream& operator>>(istream& in,Sorting& a){
                              cout<<"Banyak data:";
                              in>>a.n;
                              for(int i=0;i<a.n;i++){
                                      cout<<"Data ke-"<<i+1<<":";
                                      in>>a.data[i];
                                                  }                                 
                                              return in;
                                              }
                                              ostream& operator << (ostream& out,Sorting& a){
                                                       for(int i=0;i<a.n;i++)
                                                       out<<a.data[i]<<"";
                                                       out<<"\n";
                                                       return out;
                                                       }
                                                       void Sorting::tukar(int &a,int &b)
                                                       {
                                                           int temp;
                                                           temp=a;
                                                           a=b;
                                                           b=temp;
                                                           }
                                                           void Sorting::insertion_sort()
                                                           {
                                                               int i,j,temp;
                                                               cout<<"data pertama sudah ada ditangan kiri,yaitu:"<<data[0]<<"\n";
                                                               for(j=1;j<n;j++)
                                                               {
                                                                             temp=data[j];
                                                                             cout<<"\nData ke-"<<j+1<<"yaitu"<<data[j]<<"diambil dari meja\n";
                                                                             cout<<"dilakukan penggeseran elemen:\n";
                                                                             for(i=j-1;(i>=0)&&(data[i]> temp);i--)
                                                                             {
                                                                                                         cout<<"data pada posisi ke-["<<i+1<<"]digeser ke posisi["<<i+2<<"]\n";
                                                                                                         data[i+1]=data[i];
                                                                                                         }
                                                                                                         cout<<"Data baru masuk pada posisi ke-["<<i+2<<"]\n";
                                                                                                         data[i+1]=temp;
                                                                                                         cout<<"Data saat ini adalah:";
                                                                                                         for(int k=0;k<=j;k++)cout<<data[k]<<"";
                                                                            
                                                                                                         }
                                                                                                                                                                                                              
                                                                                                         }
                                                                                                        
int main()
{
    Sorting angka;
    cin>>angka;
    angka.insertion_sort();
    cout<<"\nHasil akhir adalah:\n";
    cout<<angka;

    system("PAUSE");
    return EXIT_SUCCESS;
}




selection sorting


#include <cstdlib>
#include <iostream>
#include <conio.h>
#include <math.h>

using namespace std;

int baca_data(int A[],int n)
{
    int i;
    for(i=0;i<n;i++)
    {
                    cout << "Data ke-" <<i+1<<":";
                    cin >> A[i];
                    }
                    }
                    int cetak_data(const int A[],int n)
                    {
                        int i;
                        for(i=0;i<n;i++)
                        cout<<""<<A[i];
                        cout << "\n";
                        }
                        int tukar(int *a,int *b)
                        {
                            int temp;
                            temp=*a;
                            *a=*b;
                            *b=temp;
                            }
                            int minimum(int A[],int dari,int n,int * tempat)
                            {
                                int i,min;
                                min=A[dari];
                                *tempat=dari;
                                for(i=dari+1;i<n;i++)
                                if(A[i] < min)
                                {
                                        min=A[i];
                                        *tempat=i;
                                        }
                                        }
                                        int selection_sort(int A[],int n)
                                        {
                                            int i,t;
                                            for(i=0;i<n;i++)
                                            {
                                                            minimum(A,i,n,&t);
                                                            tukar(&A[i],&A[t]);
                                                            }
                                                            }
                                                           
int main(int argc, char *argv[])
{
    int data[10],n;
    cout<<"banyak data:";
    cin>>n;
    baca_data(data,n);
    cetak_data(data,n);
    selection_sort(data,n);
    cetak_data(data,n);
   
    system("PAUSE");
    return EXIT_SUCCESS;
}