short

Program Insertion Sort Ascending

#include<iostream.h>
#include<conio.h>
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()
{
int i;
cout<<"PROGRAM INSERTION SORT ASCENDING"<<endl;
cout<<"Masukkan jumlah data: "; cin>>n;
for(int i=1; i<=n; i++)
    {
    cout<<"Masukkan data ke "<<i<<" : "; cin>>data[i];
    }
insertion_sort();
cout<<"Data setelah di sort: ";
for(i=1; i<=n; i++)
    {
    cout<<" "<<data[i];
    }getch();
}

Program Insertion Sort Descending

#include<iostream.h>
#include<conio.h>
main()
{
 int x,a[100],i,t,j,k;
 cout<<"Insertion Sort - Desc\n";
   cout<<"Masukkan banyak bilangan = ";cin>>x;
   for(i=1;i<=x;i++)
   {
    cout<<"\n Bilangan ke-"<<i<<" : ";cin>>a[i];
   }
   cout<<"\n\n data Sebelum diurutkan :";
   for(i=1;i<=x;i++)
   {
    cout<<"  "<<a[i];
   }
   cout<<endl;
   for(i=1;i<=x;i++)
   {
    for(j=1;j<=i;j++)
    {
       if(a[i]>a[j])
         {
          t=a[i];
            a[i]=a[j];
            a[j]=t;
         }
      }
      cout<<"\n # "<<i<<" : ";
      for(k=1;k<=i;k++)
      {
       cout<<"  "<<a[k];
      }
   }
   cout<<"\n\n data Setelah diurutkan secara descending : ";
   for(i=1;i<=x;i++)
   {
    cout<<"  "<<a[i];
   }
 getch();
}