CareerCup

Can you explain you question clearly with example....??

In the code below, the function maxVal returns the maximum element in the array - one should be careful with the overflow (it is used as a flag hence any +ve value not already an element of the array will do).

int b[]={5,0,3,4,-3,-8,-9,-2,7,-1,-6,10};
	int m=sizeof(b)/sizeof(b[0]);
	int flag=maxVal(b,m)+1; 
	for(i=0;i<m;i++)
	{
		if(b[i]==0)
		{
			b[i]=flag;
			break;

		}
	}
	for(i=0;i<m;i++)
	{
		if(b[i]*b[i+1]>0)
		{
			for(j=i+1;j<m;j++)
			{
				if(b[j]*b[j+1]<0)
				{
					int tmp=b[j];
					b[j]=b[j+1];
					b[j+1]=tmp;
					i--;
					break;
				}
			}
		}
	}

	for(i=0;i<m;i++)
	{
		if(b[i]==flag)
		{
			b[i]=0;
			break;

		}
	}

public void reorderArray(int[] arr)
{
	bool wasPositive = true; //was the last number positive?
	if(arr[0] < 0)
	{
		wasPositive = false;
	}
	for(int i = 1; i < arr.Length; i++)
	{
		//is number negative
		if(arr[i] < 0)
		{
			//if previous number is positive, then current negative number is in the correct spot. no need to do anything else besides updating the value of wasPositive
			if(wasPositive)
			{
				wasPositive = false;
				continue;	
			}
			else  //if previous number was negative too, keep searching the array for a positive number. If found, swap it with the current negative number.
			{
				int j = i;
				while( j < arr.Length && arr[j]  < 0)
					j++;
				if( j == arr.Length)
					break;
				else
				{
					int temp = arr[i];
					arr[i] = arr[j];
					arr[j] = arr[i];
					wasPositive = true;
				}
			}
	}

	else //If current number is positive
	{
		//if previous number is negative, then current positive number is in the correct spot. no need to do anything else besides updating the value of wasPositive
			if(!wasPositive)
			{
				wasPositive = true;
				continue;	
			}
			else  //if previous number was positive too, keep searching the array for a negative number. If found, swap it with the current positive number.
			{
				int j = i;
				while( j < arr.Length && arr[j]  >= 0)
					j++;
				if( j == arr.Length)
					break;
				else
				{
					int temp = arr[i];
					arr[i] = arr[j];
					arr[j] = arr[i];
					wasPositive = false;
				}
			}
	}

	//Print Reordered Array.
	Console.Write("{0} ", arr[0]);
	for(int i = 1; i < arr.Length; i++)
	{
		Console.Write("{0} ", arr[i]);
		if( i % 10 == 0)
			Console.WriteLine();
	}
}

arrangeArray(int[] arr)
{
int nextPositive = -1;
int nextNegative = 1;
if(arr[0] < 0)
isPrevPositive = false;
else
isPrevPositive = true;
for(int i = 1; i < Arr.len; i++)
{
if((arr[i] < 0 && isPrevPositive) || (arr[i] >= 0 && !isPrevPositive) )
continue;
else
if(arr[i] < 0)
{
nextNegative = arr[i];
if(nextPositive ! = -1)
{arr[i] = nextPositve;
nextPositve = -1;
}
else
arr[i] = getNextPositive(arr, int i);
}
if(arr[i] >= 0)
{
nextPositive = arr[i];
if(nextNegative ! = 1)
{arr[i] = nextNegative;
nextNegative = 1;
}
else
arr[i] = getnextNegative(arr, int i);
}
}

}

## In perl
#!usr/bin/perl -w
use strict;
use warnings;

$|=1;
my $i = 0 ; my $j = 0 ;
my @array = qw(-1 -2 -3 -4 5 6 7 -8 9 -10 -11 12 );
my $pos = 0 ; my $neg = 0 ;
my @pos_array ;
my @neg_array ;

complete_array(\@array);

sub complete_array
{

my @array_num = @{$_[0]};
foreach (@array_num)
{
print $_ . " ";
}

}
print "\n\n" ;


foreach my $num(@array)
{
if($num > 0 )
{
push @pos_array ,$num ;
}
else
{
push @neg_array,$num ;
}
}
print "Positive array : ";
complete_array(\@pos_array);
print "\n\n" ;
print "Negative array : ";
complete_array(\@neg_array);
print "\n\n" ;

my $pos_num = @pos_array ;
my $neg_num = @neg_array;
my $min_num = &minimum($pos_num,$neg_num);

print "\n\nHere is our Min num : ".$min_num ."\n\n" ;
for ($i = 0, $j = 0; $i< $min_num ; $i++,$j++ )
{
print $neg_array[$j] . " ". $pos_array[$i] . " " ;
}

my $diff_arrays = &differenc($pos_num,$neg_num);
print "\n Difference is : $diff_arrays \n";

sub differenc
{
$pos = shift ;
$neg = shift ;

if($pos > $neg)
{

my $diff_num = $pos - $neg ;
for($i ; $i < $min_num + $diff_num ;$i++)
{
print $pos_array[$i] ." " ;
}
return $pos - $neg ;
}
else
{
my $diff_num = $neg - $pos ;
for($j ; $j < $min_num + $diff_num ;$j++)
{
print $neg_array[$j] ." " ;
}
return $neg - $pos ;
}

}

sub minimum
{
$pos = shift ;
$neg = shift ;

if($pos > $neg)
{
return $neg ;
}
else
{
return $pos ;
}


}
print "\n" ;