HELP ... C HELP..!!!

[haarshlife]

ayyala mata me tika C coding ekakata convert karaganna hati kiyannakooo...

while true
do repeat j--
until A[j] <= x
repeat i++
until A >=x

thnkuu

 

[haarshlife]

....

 

[vidura99]

true wena condition eka mokakda?

 

[haarshlife]

true wena condition eka mokakda?

bro condition eka i<=j

 

[DjSpK]

c nam danne naha onenam java valin dennam

 

[haarshlife]

c nam danne naha onenam java valin dennam

eth kamak naha bro... mama c daganna try ekak dennam.. hehe

 

[ŦĦĔ ƦȆƉǾӾ]

mokakda macho oya program eka?
mokakda oken wenna ona

 

[haarshlife]

mokakda macho oya program eka?
mokakda oken wenna ona

meka mcn quicksort ekak... meken wenna oone api dena values ascending order ekakata hadena ekai.. hehe.. mata therenne naththe oya code kaalla C ekata convert karana hati mchnz..

 

[ms48mail]

onne nam java code 1 dennam

 

[haarshlife]

onne nam java code 1 dennam

eth kamak na ..dennako bro

 

[DjSpK]

meka mcn quicksort ekak... meken wenna oone api dena values ascending order ekakata hadena ekai.. hehe.. mata therenne naththe oya code kaalla C ekata convert karana hati mchnz..

Array ekakata sort karagannada ?

 

[haarshlife]

Array ekakata sort karagannada ?

ow bro... mama code eka gahala thiyenne.. aula thiyenne oya tike... gahana gahana hama welema core dump wenawa mchnzz..

 

[ŦĦĔ ƦȆƉǾӾ]

http://cprogramminglanguage.net/quicksort-algorithm-c-source-code.aspx
meke thiyanawa coding ekanan
java ekanan man gawath thiyanawa,man nan c wadiya danne naa


class quick{
public void sort(int A[],int left,int right){
if(left<right){
int p=quicksort(A,left,right);
sort(A,left,p-1);
sort(A,p+1,right);
}

}

public int quicksort(int A[],int left,int right){
int temp=0;
int pivot=A

;
int l=left+1;
int r=right;

while(l<r){
while(l<right&&A[l]<pivot){
l++;
}
while(r>left&&A[r]>=pivot){
r--;
}
if(l<r){
temp=A[l];
A[l]=A[r];
A[r]=temp;
}
}
if(A[r]<=pivot){
A

=A[r];
A[r]=pivot;
}
return r;

}
}​

 

[haarshlife]

http://cprogramminglanguage.net/quicksort-algorithm-c-source-code.aspx
meke thiyanawa coding ekanan
java ekanan man gawath thiyanawa,man nan c wadiya danne naa


class quick{
public void sort(int A[],int left,int right){
if(left<right){
int p=quicksort(A,left,right);
sort(A,left,p-1);
sort(A,p+1,right);
}

}

public int quicksort(int A[],int left,int right){
int temp=0;
int pivot=A

;
int l=left+1;
int r=right;

while(l<r){
while(l<right&&A[l]<pivot){
l++;
}
while(r>left&&A[r]>=pivot){
r--;
}
if(l<r){
temp=A[l];
A[l]=A[r];
A[r]=temp;
}
}
if(A[r]<=pivot){
A

=A[r];
A[r]=pivot;
}
return r;

}
}​

thnk u very much ayya ​