Marge Sort

#include <cstdlib>

#include <iostream>

using namespace std;

void Merge(int* A, int kiri,int tengah, int kanan){

    int B[kiri+kanan];

    int i,kidal1,kidal2;

  

    kidal1=kiri;

    kidal2=tengah+1;

    i=kiri;

  

    while (kidal1<=tengah && kidal2 <= kanan){

                                              if(A[kidal1] <= A[kidal2]){

                                                                         B[i]=A[kidal1];

                                                                         kidal1++;

                                                                         }

                                              else{

                                                   B[i]=A[kidal2];

                                                   kidal2++;

                                                   }

                                              i++;

                                              }

    while ( kidal1 <= tengah ){

                               B[i] = A[kidal1];

                               kidal1++;

                               i++;

                               }

    while ( kidal2 <= kanan ){

                              B[i] = A[kidal2];

                              kidal2++;

                              i++;

                              }

    for (int i=kiri;i<= kanan;i++){

                                   A[i]=B[i];

                                   }

    }

void MergeSort (int* A, int i, int j){

    int k;

  

    if (i<j){

             k= ((i+j)/2);

             MergeSort(A, i, k);

             MergeSort(A, k+1, j);

             Merge(A, i, k, j);

             }

    }

int main(int argc, char *argv[]){

    int n;

    int i;

    int j;

    cout<<"Masukkan junlah data : ";

    cin>>n;

    i=1;

    j=n;

    int A[n];

    for (int x=1;x<=n;x++){

                          cout<<"masukan data ke-"<<x<<" : ";

                          cin>>A[x];

                          }

    cout<<"Data sebelum diurutkan : ";

    for (int x=1;x<=j;x++){

                          cout<<A[x]<<" ";

                          }

    cout<<endl;

    MergeSort(A,i,j);

    cout<<"Data sesudah diurutkan : ";

    for (int x=1;x<=j;x++){

                          cout<<A[x]<<" ";

                          }

    cout<<endl;

  

system("pause");

return 0;

}

Algoritma Prims

#include <iostream>
#include <stdlib.h>


/* run this program using the console pauser or add your own getch, system("pause") or input loop */

using namespace std;

class prims{
      private:

              int n;
              int graph_edge[250][4];
              int g;
              int tree_edge[250][4];
              int t;
              int s;
              int T1[50],t1;
              int T2[50],t2;
             
      public:
             void input();
             int findset(int);
             void algorithm();
             void output();
      };
     
void prims::input(){
     cout<<"Masukkan No Node : ";
     cin>>n;
     g=0;
     cout<<"Enter the weights for the following edges : \n";
     for(int i=1;i<=n;i++){
             for(int j=i+1;j<=n;j++){
                     cout<<"< "<<i<<", "<<j<<" > : ";
                     int w;
                     cin>>w;
                     if(w!=0){
                              g++;
                              graph_edge[g][1]=1;
                              graph_edge[g][2]=j;
                              graph_edge[g][3]=w;
                              }
                     }
             }
     cout<<"\n\nThe edges in the given graph are : \n";
     for(int i=1;i<=g;i++){
             cout<<"< "<<graph_edge[i][1]<<" , "<<graph_edge[i][2]<<" > : "<<graph_edge[i][3]<<endl;
             }
     }
   
int prims::findset(int x){
    for(int i=1;i<=t1;i++){
            if(x==T1[i]) return 1;
            }
    for(int i=1;i<=t2;i++){
            if(x==T2[i]) return 2;
            }
    return -1;
    }
   
void prims::algorithm(){
     t=0;
     t1=1;
     T1[1]=1;
     t2=n-1;
     int i;
     for(i=1;i<=n;i++){
                       T2[i]=i+1;
                       }
     cout<<"\nThe Algorithm starts\n\n";
     while(g!=0 && t!=n-1){
                int min=9999;
                int p;
                int u,v,w;
                for(int i=1;i<=g;i++){
                        bool flag1 = false, flag2 = false;
                        if(findset(graph_edge[i][1])!=findset(graph_edge[i][2])){
                                 if(min>graph_edge[i][3]){
                                 min=graph_edge[i][3];
                                 u=graph_edge[i][1];
                                 v=graph_edge[i][2];
                                 w=graph_edge[i][3];
                                 p=i;
                                 }
                                 }
                  }
                cout<<"The edge include in the tree is : ";
                cout<<"< "<<u<<", "<<v<<" >\n";
               
                for(int l=p;l<g;l++){
                        graph_edge[l][1]=graph_edge[l+1][1];
                        graph_edge[l][2]=graph_edge[l+1][2];
                        graph_edge[l][3]=graph_edge[l+1][3];
                        }
                g--;
                t++;
                tree_edge[t][1]=u;
                tree_edge[t][2]=v;
                tree_edge[t][3]=w;
                t++;
               
                int m;
                if(findset(v)==2){
                                  T1[t1]=v;
                                  m=v;
                                  }
                else if(findset(u)==2){
                     T1[t1]=u;
                     m=u;
                     }
                int x;
                for(x=1;T2[x]!=m;x++){
                                       for(;x<t2;x++){
                                                      T2[x]=T2[x+1];
                                                      }
                                       }
                                       t2--;
                int k;
                cout<<"NOW\nT1 : ";
                for(k=1;k<=t1;k++) cout<<T1[k]<<" ";
                cout<<endl;
                cout<<"T2 : ";
                for(k=1;k<=t2;k++) cout<<T2[k]<<" ";
                cout<<endl;
               
                cout<<"The graph edges are : \n";
                for(int i=1;i<=g;i++){
                        cout<<"< "<<graph_edge[i][1]<<", "<<graph_edge[i][2]<<" > : "<<graph_edge[i][3]<<endl;
                        }
                cout<<"\n\n";
                }
     }
   
void prims::output(){
     cout<<"\nThe selected edges are : \n";
     for(int i=1;i<=t;i++){
             cout<<"< "<<tree_edge[i][1]<<", "<<tree_edge[i][2]<<" > : "<<tree_edge[i][3]<<endl;
             }
     }

int main(int argc, char *argv[])
{
    awal:
    prims dyas;
    dyas.input();
    dyas.algorithm();
    dyas.output();
   
    char L;
    cout<<"\n\nLanjut? : ";
    cin>>L;
    if(L=='y') {
               system("cls");
               goto awal;
               }
   
    system("PAUSE");
    return EXIT_SUCCESS;
}