Partisi Array

 4.5 Partisi Array

1. masalah

                Diberikan secara acak pada pemesanan array dari n elemen , memeuatkan elemen tersebut kedalam 2 bagian dimana elemen tersebut kurang dari  x didalam satu bagian dan elemen lebih besar dari x adallah pada bagian yang lain.

2. input dan output

                X= aray of integer

I=integer

J=integer

N=integer

X= integer

P=integer

T=integer  

3. algoritma

Read n;

Read x;

Iß i

J ß n

While (i<j) and ([i] < = x) do 1<I +1 end

While

While (I < j) and (a [i] > x do I ß j +1 end

While if a [i] > x + then j=j-1

While i<j do

To ß a[i]

A [i] ß a [i]

A [i] ß t

Iß i+1

Jß j-1 end while

While < [i] < = x do I ß i+1 end while

While < [i] <  x do j ß j-1 end while

end while

4. coding

Class array 4{

Friend istream x operation >> (istream & , array 4 &);

Friend ostream x operation >> (ostream & , array 4 &);

Public ;

Void cetak_input ();

Void cetak_array();

Array 4();

Private;

Int a [100],n,p,x;

};

Array 4 :: array 4 (){

Cout << “mengurutkan angka “;

Cout <<”memasukan digit indeks “;

Cin >> n ; }

Void array 4 :: cetak_input (){

For (int i=0;i++){

Cout << “ masukan data ke-“ << i+1<<”;” ;

Cin >> i[i]}

For (int i=0; < n ; i++){

Cout << a [i] ;}

Void array 4 :: cetak-array(){

Int I,j;

I=i

J=n;

X= a[i];

X= a[i];

P = a [i];

While ([i<j) & (a[i] < = x){

I=i+1;}

While ([i<j] & (a[j]>< ){

J= j+1;}

If (a [i] > x)

J=j-I;

Else

While (i<j){

A [i]=a[i];

I=i+1;

J= j+1;}

While (a [i] <= x){

I=i+1;}

While (a [i] > x){

J=j-I;}