Quick Sort (Turbo Pascal)

{ Quick Sort
  g0tch4.blogspot.com }

uses crt;
const
 max = 10;
type
 arr = array [1..max] of byte;
 var
    data :arr;
    x,y :byte;

procedure input;
begin
    clrscr;
    writeln ('Program Sorting Data dengan Quick Sort');
    writeln;
    writeln ('Inputkan 10 buah bilangan :');
    writeln ('---------------------------');
    for x:= 1 to max do
    begin
         write ('Data ke-',x,'= '); readln (data[x]);
    end;
    clrscr;
    writeln ('Data Sebelum diurutkan: ');
    writeln ('---------------------------');
    for x:= 1 to max do
         write (data[x],' ');
         writeln;writeln;
         writeln('Data Sesudah diurutkan:');
         writeln('---------------------------');
end;

procedure change(var a,b :byte);
var c : byte;
begin
    c:=a; a:=b; b:=c;
end;

procedure asc_quick(l,r :integer);
var
    mid,j,k :integer;
begin
    j:=l; k:=r; mid:=(l+r) div 2;
    repeat
         while data [j] <> data [mid] do dec(k);
         if j<=k then           begin                change (data [j],data[k]);                inc(j); dec(k);           end;      until j>k;
    if l <> data[mid]  do inc(j);
         while data [k] <>k;
    if l < k then desc_quick(l,k);
    if j < r then desc_quick(j,r);
end;

procedure output;
begin
    for x :=1 to max do
         write(data[x],' ');
         writeln;
end;

begin
    input;
    asc_quick(1,max);write('Secara Ascending  : ');
    output;
    desc_quick(1,max);write('Secara Descending : ');
    output;
    readkey;
end.

Merge Sort (Turbo C++)

/* Merge Sort
   g0tch4.blogspot.com */

#include "iostream.h"
#include "conio.h"

void merge(long [], int, int);
void merge_sort(long [], int);

main()
{
   clrscr();
   const int array_size = 10;
   long array[array_size] = {0};
   cout<<"******************************************"<< count_1="0;">>array[count_1];
   merge_sort(array, array_size);
   gotoxy(35,10);
   cout<<"Elemen-Elemen Yang Sudah di Sortir : ";  
   for(int count_2=0;count_2 < temp_array =" new" count_1 =" 0;" count_2 =" 0;" count_3 =" 0;" count_4="0;">1)
   {
      int sub_array_size_1 = array_size/2;
      int sub_array_size_2 = array_size - sub_array_size_1;
      merge_sort(array, sub_array_size_1);
      merge_sort(array+sub_array_size_1, sub_array_size_2);
      merge(array, sub_array_size_1, sub_array_size_2);
   }
}

Bubble Sort (Turbo C++)

/* Bubble Sort
   g0tch4.blogspot.com */

#include "iostream.h"
#include "stdio.h"
#include "conio.h"

void main()
{
    int A[100], N;
    int i,j,k;
    int temp;
    clrscr();
    cout<<"******************************************"<<>>N;
    cout<<"Input Elemen Array : "<< i="1;">>A[i];
}
cout<<"Data-Data yang Belum Diurutkan\n";
for (i=1;i<=N;i++) { cout << i="1;" j="1;">A[j+1])
{
    temp = A[j];
    A[j] = A[j+1];
    A[j+1] = temp;
    for (k=1;k<=N;k++)
    {
       cout<< A[k] << " ";
    }
    getch();
    cout<< endl;
}
cout<<"Hasil Pengurutan Secara Ascending"<< endl;
for (i=1;i<=N;i++)
{
   cout << A[i];
   cout <<" ";
}
getch();
}

Segitiga Pascal (Turbo Pascal)

{ Segitiga Pascal
  g0tch4.blogspot.com }

uses crt;
var num:array[1..100] of longint;
i,j,n,batas:integer;
begin
        clrscr;
        write('Masukkan n: ');
        readln(n);
        num[1]:=1;
        writeln(1);
        for i:=1 to n do
        begin
            batas:=(i+1) div 2;
            if not odd(i) then num[batas+1]:=num[batas]*2;
            for j:=batas downto 2 do num[j]:=num[j]+num[j-1];
            for j:=1 to batas do write(num[j],' ');
            if not odd(i) then write(num[batas+1],' ');
            for j:=batas downto 1 do write(num[j],' ');
            writeln;
       end;
       readkey;
end.