twitter
Tampilkan postingan dengan label APL. Tampilkan semua postingan
Tampilkan postingan dengan label APL. Tampilkan semua postingan

INSERTION SORT


Posted in Labels: ,


 

#include
#include         
int data[10],data2[10];
int n;
void tukar(int a, int b)
{ int t;
 t = data[b];
 data[b] = data[a];
 data[a] = t;
} void insertion_sort()
{ int temp,i,j;
 for(i=1;i<=n;i++)
 { temp = data[i];
  j = i -1;
  while(data[j]>temp && j>=0)
  { data[j+1] = data[j];
                j--;
  }
 data[j+1] = temp;
 }}
void main()
{  cout<<"===PROGRAM INSERTION SORT==="<
 //Input Data
 cout<<"Masukkan Jumlah Data : ";
 cin>>n;
 for(int i=1;i<=n;i++)
 {  cout<<"Masukkan data ke "<<<" : ";
  cin>>data[i];
  data2[i]=data[i];
 }  insertion_sort();
 cout<<"\n\n";
 //tampilkan data
 cout<<"Data Setelah di Sort : ";
 for( i=1; i<=n; i++)
 {
  cout<<" "<
 }
 cout<<"\n\nSorting Selesai";
 getch(); }

Tugas Binary Search


Posted in Labels: ,




Nama : Meta Lara Pandini
NIM    : 0907055058


#include
#include
void binary_search(int tabel1[], int max, int cari, int &indeksnya);
void seq_search(int tabel1[], int max);
main()
{
     int a, imax, nilainya, indeksnya;
     cout << "Input Banyaknya Nilai : ";
     cin >> imax;
     int tabelnya[100];
     for (a=1;a<=imax;a++)
     {
         cout << "Nilai ke-" << a << " : ";
         cin >> tabelnya[a];
     }
     seq_search(tabelnya, imax);
     cout << "\nTabel setelah diurutkan " << endl;
     for (a=1;a<=imax;a++)
     {
         cout << "Nilai ke-" << a << " = " << tabelnya[a] << endl;
     }
     cout << "Nilai yang ingin dicari = ";
     cin >> nilainya;
     binary_search(tabelnya, imax, nilainya, indeksnya);
     if (indeksnya != 0)
        cout << "Indeks = " << indeksnya;
     else
         cout << "Data tidak ditemukan";
     getch();
     return 0;
}
void seq_search(int tabel1[], int max)
{
     int a, b, temp;
     for (a=2;a<=max;a++)
     {
         temp = tabel1[a];
         b = a - 1;
         while ((b>=1) && (temp < tabel1[b]))
         {
               tabel1[b+1] = tabel1[b];
               b--;
         }
         tabel1[b+1] = temp;
     }
}

void binary_search(int tabel1[], int max, int cari, int &indeksnya)
{
     int atas, bawah, tengah;
     bool ketemu;
     bawah = 1;
     atas = max;
     ketemu = false;
     while ((bawah < atas) && (!ketemu))
     {
           tengah = ((bawah+atas)/2);
           if (tabel1[tengah] == cari)
              ketemu = true;
           else if (tabel1[tengah] < cari)
                bawah = tengah+1;
           else
               atas = tengah-1;
          
           if (ketemu)
              indeksnya = tengah;
           else
               indeksnya = 0;       
     }
}

Program Pengurutan Harga Dengan C++

0 comments
Posted in Labels: ,



#include
#include
#define max 5
main()
{
                typedef struct transaksi {
                                char nama[30], nim[12];
                                double harga ;
                                int urutan;
                };

                transaksi trn[max];
                int i, j;
                float total=0;

                cout << "- Input Data" << endl;
                for (i=1;i<=max;i++) {
                                cout << "  Data ke-" << i << endl;
                                cout << "  Masukkan Nama  : ";
                                cin >> trn[i].nama;
                                cout << "  Masukkan NIM   : ";
                                cin >> trn[i].nim;
                                cout << "  Masukkan Harga : ";
                                cin >> trn[i].harga;
                                cout << endl;
                }

                for (i=1;i<=max;i++) {
                                trn[i].urutan=max;
                                for (j=1;j<=max;j++) {
                                                if (trn[i].harga>trn[j].harga)
                                                trn[i].urutan--;
                                }
                                total+=trn[i].harga;
                }

                cout << endl << "- Harga Tertinggi" << endl;
                for (i=1;i<=max;i++) {
                                if (trn[i].urutan == 1) {
                                  cout << "  Nama  : " << trn[i].nama << endl;
                                  cout << "  NIM   : " << trn[i].nim << endl;
                                  cout << "  Nilai : " << trn[i].harga << endl;
                                }
                }

                cout << endl << "- Harga Terendah" << endl;
                for (i=1;i<=max;i++) {
                                if (trn[i].urutan == max) {
                                  cout << "  Nama  : " << trn[i].nama << endl;
                                  cout << "  NIM   : " << trn[i].nim << endl;
                                  cout << "  Nilai : " << trn[i].harga << endl;
                                }
                }

                cout << endl << "- Rata Rata" << endl;
                cout << "  Total                      : " << total << endl;
                cout << "  Jumlah Transaksi : " << max << endl;
                cout << "  Rata-rata        : " << total/max << endl;

                cout << endl << "- Semua Data (Diurutkan berdasarkan Harga)" << endl;
                for (i=1;i<=max;i++) {
                                for (j=1;j<=max;j++) {
                                                if (trn[j].urutan == i) {
                                                                cout << "  * Urutan ke-" << trn[j].urutan << endl;
                                                                cout << "    Nama  : " << trn[j].nama << endl;
                                                  cout << "    NIM   : " << trn[j].nim << endl;
                                                  cout << "    Harga : " <<< endl << endl;
                                                }
                                }
                }

                getch();
                return 0;
}