Pengurutan Stack


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

int data[10],data2[10];
int jml_index;

void tukar(int a,int b)
{ int temp;
temp = data[b];
   data[b] = data[a];
   data[a] = temp;}

void Tampil(int data[])
{ cout<<"Isi array : ";
for (int i=0;i<jml_index;i++)
    {cout<<data[i]<<" ";}
   cout<<endl;}

void SelectionSortASC()
{ cout<<"Kondisi sebelum selection sort ASC "<<endl;
Tampil(data);
   int posisi,i,j;

   for(i=0;i<jml_index-1;i++)
   { posisi = i;
    for (j=i+1;j<jml_index;j++)
      {if (data[j] < data[posisi])
      {posisi = j;} }
      if (posisi !=i)
      {tukar(posisi,i);}
   }
   cout<<"kondisi setelah selection sort ASC"<<endl;
   Tampil(data);
}

void SelectionSortDESC()
{ cout<<"kondisi sebelum selection sort DESC"<<endl;
Tampil(data);
   int posisi,i,j;

   for(i=0;i<jml_index-1;i++)
   { posisi = i;
    for (j=i+1;j<jml_index;j++)
      { if (data[j] > data [posisi])
      {posisi = j;}}
      if(posisi !=i)
      {tukar(posisi,i);}
   }
   cout<<"kondisi setelah selection sort DESC"<<endl;
   Tampil(data);
}

void InsertionSortASC()
{ cout<<"kondisi sebelum insertion sort ASC"<<endl;
Tampil(data2);
   int temp,i,j;
   for(i=1;i<jml_index;i++)
   {
    temp = data2[i];
      j=i-1;

      while (data2[j]>temp && j>=0)
      { data2[j+1] = data2[j];
      j--;}

      data2[j+1]=temp;
   }
   cout<<"kondisi setelah Intertion sort ASC"<<endl;
   Tampil(data2);
}

void InsertionSortDESC()
{ cout<<"kondisi sebelum Insertion sort DESC"<<endl;
Tampil(data2);
   int temp,i,j;
   for(i=1;i<jml_index;i++)
   { temp = data2[i];
   j=i-1;

    while (data2[j]<temp && j>=0)
    { data2[j+1] = data2[j];
    j--;}

    data2[j+1]=temp;
}
   cout<<"kondisi setelah intertion sort DESC"<<endl;
   Tampil(data2);
}

void Input()
{
cout<<"masukkan jumlah data (1 s/d 10) = ";
   cin>>jml_index;

   if (jml_index<1 || jml_index>10)
    {cout<<"jml yg anda masukkan salah";}
   else
{
      for (int i=0;i<jml_index;i++)
         {
          cout<<"masukkan data ke- "<<(i+1)<<" = ";
            cin>>data[i];
            data2[i]=data[i];
         }
      }
}

void Seq_Search(int cari)
{
int posisi=0, ketemu=0;

   for(int i=0;i<jml_index;i++)
   {
    if(data[i]==cari)
      {
          ketemu = 1;
            posisi = i;
            break;
         }
   }

   if (ketemu == 1)
   {cout<<"Data "<<cari<<" ada pada posisi : "<<posisi;}
   else
   {cout<<"Data "<<cari<<" TIDAK DITEMUKAN. ";}
}

void Bin_Search(int cari)
{
cout<<"\t== PROSES PENGURUTAN DATA =="<<endl;
   SelectionSortASC();

   int ketemu=0, kiri=0, kanan=(jml_index-1), tengah;
   while (kiri<=kanan && ketemu==0)
   {
    tengah = (kiri+kanan)/2;
      if(data[tengah]==cari)
      ketemu =1;
      else if (cari<data[tengah])
      kanan = tengah-1;
      else
      kiri = tengah+1;
   }

   if(ketemu==1)
   {cout<<"Data "<<cari<<" ada pada posisi : "<<tengah;}
   else
   {cout<<"Data "<<cari<<" TIDAK DITEMUKAN. ";}
}

void main()
{
int pil;
   clrscr();
   do
   {
    clrscr();
      cout<<"1. Input data"<<endl;
      cout<<"2. Selection sort ASC"<<endl;
      cout<<"3. Selection sort DESC"<<endl;
      cout<<"4. Insertion sort ASC"<<endl;
      cout<<"5. Insertion sort DESC"<<endl;
      cout<<"6. Keluar"<<endl;
      cout<<"7. Sequential"<<endl;
      cout<<"8. Binary"<<endl;
      cout<<"======================="<<endl;
      cout<<"Masukkan pilihan = ";cin>>pil;

      switch(pil)
      {
      case 1:Input();break;
         case 2:SelectionSortASC();break;
         case 3:SelectionSortDESC();break;
         case 4:InsertionSortASC();break;
         case 5:InsertionSortDESC();break;
         case 7:Seq_Search;break;
         case 8:Bin_Search;break;
      }
      getch();
   }while (pil!=6);
}

Comments

Post a Comment

Popular posts from this blog

Animasi Lucu C++

#include <iostream.h> #include <conio.h> #include <stdlib.h> int top,i; char key,temp,e; char stack[10]; void delay(); void pushanim() {  for(i=0;i<=17; i++)  {   gotoxy(22+i,7);cout<<" ";   gotoxy(23+i,7); cout<<temp; delay();  }  for(i=1;i<=(14-top);i++)  {   delay();   gotoxy(40,6+i); cout<<" ";   gotoxy(40,7+i); cout<<temp;  } } void popanim(char temp) {  for(i=1;i<=(14-top);i++)  {   delay();   gotoxy(40,22-i-top); cout<<" ";   gotoxy(40,21-i-top); cout<<temp;  }  for(i=1;i<=19;i++)  {   delay();   gotoxy(38+i,7); cout<<" ";   gotoxy(39+i,7); cout<<temp; delay();  }  gotoxy(58,7);cout<<" "; } void push(char e) {  top=top+1;  stack[top]=e;  pushanim(); } void pop(char e) {  if(top !=0)  {   e=stack[t...
Read more

Sistem Sensor dan Robotika

Image
Sistem Sensor dan Robotika (Sensor Untuk Robot) Sensor adalah peranti yang menerima input berupa suatu besaran/sinyal fisik yang kemudian mengubahnya menjadi besaran/sinyal lain yang diteruskan ke kontroler. Terdapat banyak jenis sensor yang digunakan pada robot. Bahasan ini akan meliputi beberapa jenis sensor yang digunakan terutama pada mobile robot dan lebih dititikberatkan pada antarmuka dengan kontroler. Sensor dapat diklasifikasikan berdasarkan outputnya, yaitu : ●      Output biner : berupa 0 (0 V) atau 1 (5 V). ●      Output analog : misal 0 V hingga 5 V. ●      Output pewaktu : misal PWM, waktu RC, waktu pantul ●      Output serial : misal UART (RS232), I2C, SPI, 1 wire, 2 wire, serial sinkron ●      Output paralel Sensor juga dapat diklasifikasikan berdasarkan aplikasinya seperti terlihat pada Tabel 0-1.   Tabel 0 1 Lokal Globa...
Read more

DDL Part II

Image
Outline • Overview of Database Transactions • Commit • Savepoint • Rollback Database Transactions A database transaction consists of one of the following: • DML statements which constitute one consistent change to the data • One DDL statement • One DCL statement Database Transactions • Begin when the first DML SQL statement is executed • End with one of the following events:      – A COMMIT or ROLLBACK statement is issued      – A DDL or DCL statement executes (automatic commit)      – The system crashes Advantages of COMMIT and ROLLBACK Statements With COMMIT and ROLLBACK statements, you can: • Ensure data consistency • Preview data changes before making changes permanent • Group logically related operations Controling Transactions Diagram Rolling Back Changes to a Savepoint • You can create a marker in the current transaction by using the SAVEPOINT statement which divide...
Read more