Quick sort is a sorting method in a programming language. The process of sorting or sorting based on the method of divide and Conqueror. This sort Quick sort data very quickly. But of course this has a shortage of quick sort. For example, the process of sorting performed recursively. Although the process is very fast, but he spent a great memory if the data is sorted a lot. In addition, the quick sort is also not suitable when used to sort the data in the tables are small.

Algoritma :

Procedure quick_sort(output data : larik ; input n : integer)

Deklarasi

i, n, lb,ub   : integer

up,down    : integer

temp          : integer

Deskripsi

read(n)

for i <= to 1 n do

arr[i]

enfor

{ pensortingan akan dilakukan }

if (lb>=ub)

   return

a=darr[lb]

up=ub

down=lb

while (down < up)do

down <=down +1

endwhile

while (darr[down] <= a)do

up <= up – 1

endwhile

if(down<up) then

temp=darr[down]

darr[down]=darr[up]

darr[up]=temp

endif

darr[lb]=darr[up]

darr[up]=a

quick_sort(darr,lb,up-1)

quick_sort(darr,up+1,ub)

endwhile

Berikut kode programnya :

#include <iostream.h>

#include <conio.h>

#define max 20

void quick_sort(int darr[max], int lb, int ub)

{

  int a;

   int up,down;

   int temp; 

   if (lb>=ub)

    return;

   a=darr[lb];

   up=ub;

   down=lb;

   while (down < up)

   {

     while (darr[down] <= a)

       down++;

      while (darr[up]>a)

       up--;

      if(down<up)

      {

        temp=darr[down];

         darr[down]=darr[up];

         darr[up]=temp;

      }

   }

   darr[lb]=darr[up];

   darr[up]=a;

   quick_sort(darr,lb,up-1);

   quick_sort(darr,up+1,ub);

}

void main()

{

  int arr[max];

   int i,n,lb,ub;

   lb=0;

   cout<<"Masukkan banyak data yang ingin diurut: ";

   cin>>n;

   ub=n;

   cout<<"Masukkan data-datanya: \n\n";

   for(i=1;i<=n;i++)

   {

     cout<<"\tdata ke- "<<i<<" : "; cin>>arr[i];

   }

   quick_sort(arr,lb,ub);

   cout<<"\nHasil pengurutan data: ";

   for(i=0; i<n;i++)

    cout<<" "<<arr[i];

   cout<<"\n\nTekan sembarang tombol untuk keluar ";

   getch();

}

explanation:
Above program describe how the quick sort is a sorting method which is how it works to choose one of the elements of pivot elements (a). This element will be used as a comparison to other elements for stacking with the composition <a,a, and> a ie all the elements to the left of a, the element is smaller than a, while all the elements on the right a, all greater than a.

Ilustration :

Merge sort is a sorting algorithm in computer science designed to meet the needs of sorting on a data set that does not allow to be stored in computer memory because the amount is too large. This algorithm was invented by John von Neumann in 1945.

Algoritma :

Procedure merge_sort (input : data (larik),n; output : data(larik))

Deklarasi

data                    : integer of array

n                         : integer

Deskripsi

read(data)

int temp[100], tempAwal = awal, tempMid = mid, i = 0

while (tempAwal < mid && tempMid < akhir) do

if(data[tempAwal] < data[tempMid]) then

temp[i] = data[tempAwal]

else

temp[i] = data[tempMid]

endif

endwhile

while(tempAwal < mid)do

temp[i] = data[tempAwal]

endif

while(tempMid < akhir)do

temp[i] = data[tempMid]

endif

for j <= 0 to i do

for k <= awal to akhir do

data[k] = temp[j]

endfor

endfor

if(akhir-awal != 1)

int mid = (awal+akhir)/2

merge(awal, mid)

merge(mid, akhir)

mergeSort(awal, mid, akhir)

endif

read(n)

for i ß 0 to n do

data[i]

merge(0,n)

endfor

Berikut kode programnya :

#include <iostream>

  

int data[100];

void mergeSort(int awal, int mid, int akhir)

{

    cout<<endl;

    int temp[100], tempAwal = awal, tempMid = mid, i = 0;

    while(tempAwal < mid && tempMid < akhir)

    {

        if(data[tempAwal] < data[tempMid])

            temp[i] = data[tempAwal],tempAwal++;

        else

            temp[i] = data[tempMid],tempMid++;

        i++;

    }

    while(tempAwal < mid)  //kalau masih ada yang sisa

        temp[i] = data[tempAwal],tempAwal++,i++;

    while(tempMid < akhir)

        temp[i] = data[tempMid],tempMid++,i++;

    for(int j=0,k=awal;j<i,k<akhir;j++,k++)  //mengembalikan ke array semula, tapi

        cout<<data[k]<<' '<<temp[j]<<endl, data[k] = temp[j]; //sudah urut

}

void merge(int awal, int akhir) //membagi data secara rekursif

{

    if(akhir-awal != 1)

    {

        int mid = (awal+akhir)/2;

        merge(awal, mid);

        merge(mid, akhir);

        mergeSort(awal, mid, akhir);

    }

}

int main()

{

    int n;

    cout<<"Masukan banya data = ";cin>>n;

    cout<<"Masukan data yang akan di susun = ";

    for(int i=0;i<n;i++)

        cin>>data[i];

    merge(0,n);

    for(int i=0;i<n;i++)

        cout<<data[i]<<' ';

    return 0;

}

explanation:

The program above is a merge sort program is one method of sorting. Merge sort is done recursively. Step of the algorithm is a data line is divided into 2 subbarisan then sort recursively and join the results of step 2 of 2 subbarisan are sorted into the sorted sequence.

Ilustration :