Question

2) Given an array of n nonzero real numbers a[0]…a[n-1], write a function to partition the array (not sort) so that all its negative elements come before all its positive elements. Your algorithm should have O(n) time complexity. The function prototype is void negpospartition(float a[], int n) Please use C language

Answer 1

******************************************************************************************
Please Upvote the answer as it matters to me a lot :)
*****************************************************************************************
As per HomeworkLib expert answering guidelines,Experts are supposed to answer only certain number of questions/sub-parts in a post.Please raise the remaining as a new question as per HomeworkLib guidelines.
******************************************************************************************

#include <stdio.h>
void negpospartition(float a[], int n)
{
int j=0;
for (int i=0;i<n;i++)
{
if(a[i]<0)
{
int temp= a[j];
a[j]=a[i];
a[i]=temp;
j++;
}
}
}

int main() {
float a[]={-23.23,834.2,322.5,45.6,-9324};
int n =5;
negpospartition(a,n);
for(int i=0;i<n;i++)printf("%f ",a[i]);
   return 0;
}