Tampilkan postingan dengan label Struktur Data. Tampilkan semua postingan

Responsi Struktur Data

#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
    int data[10],a,temp,i,j;
    cout<<"masukkan jumlah data = ";
    cin>>a;
    for(i=1;i<=a;i++){
    cout<<"masukkan data ke-"<<i<<" = ";cin>>data[i];
    }
  
    for(i=1; i<=a; i++)
   {
       for(j=i+1; j<=a; j++)
      {
          if(data[i]>data[j])
         {
             tmp = A[i];
            A[i] = A[j];
            A[j] = temp;
         }
      }
   }
    for(int i=1;i<=data;i++){
    cout<<dataA[i]<<" ";
    }
    for(int i=1;i<=data;i++){
    if(data[i]%2==0){
                 cout<<data[i]<<" ";
                 }
    }
    system("PAUSE");
    return EXIT_SUCCESS;
}

Praktikum Struktur Data (Array)



#include <cstdlib>
#include <iostream>
#define maks 5
using namespace std;

    class Array1D{
          public:
                 Array1D();
                 void input();
                 void geser_kiri();
                 void geser_kanan();
                 void cetak();
                
          private:
                 char A[maks];                 
};
Array1D::Array1D(){
      cout<<"Belajar array 1D"<<endl<<endl;
      }
     void Array1D::input(){
          for(int i=0;i<maks; i++)
          {
          cout<<"masukan indeks ke-"<<i<<" = "<<endl;
          cin>>A[i];
          }
}
void Array1D::cetak(){
     for(int i=0; i<maks; i++){
             cout<<A[i]<<" ";
             }
             cout<<endl;
             }
     void Array1D::geser_kanan(){
          int n= maks;
          char temp = A[n-1];
          for(int i=n-2; i>=0; i--)
          A[i+1]=A[i];
          A[0] = temp;
          }
    
     int main(int argc, char *argv[]){
     Array1D x;
     x.input();
     x.cetak();
     x.geser_kanan();
     x.cetak();
    
    
    system("PAUSE");
    return EXIT_SUCCESS;
}

Popular Post

Labels

- Copyright © Irhaz Share -Irhaz Matru- Powered by Blogger - Design by Irhaz Rangga Kala -