left=0;right=n-1;
while(left<right)
{
while(left<right && a[left]%2==0)
left++;
while(left<right && a[right]%2==1)
right--;
if(left<right)
{
swap(&a[l],&a[r]);
l++;
r--;
}
O(n)
On Thu, Jul 21, 2011 at 11:49 PM, Abhishek Sharma <[email protected]>wrote:
> small change in the pseudocode..
>
>
> for (i=0 until i+ a[].length){
>
> if (*leftptr % 2 == 0)
> A2[i] = *leftptr ;
>
> else if (*rtptr % 2 == 0)
>
> A2[i+a[].length-1] = *rtptr ;
>
> leftptr++;
> rtptr--;
>
>
> }
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
