@akshat ur code doesn't give intact output, so i modified ur code and
here is the code :
int j=0,k=0;
for (i = 0; i < n; ++i)
{
if(a[i]<0)
{
a[j] = a[i];
j++;
}
else
{
temp[k] = a[i];
k++;
}
}
k=0;
for (i = j; i < n; ++i)
{
a[i] = temp[k];
k++;
}
On Jun 21, 1:47 pm, Rishabh Agarwal <rishabh...@gmail.com> wrote:
> @Abhi: if you apply quick sort then again the order will will not be intact
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
