#include<stdio.h>
#include<conio.h>
void main()
{
int *pointer,*pointer2,n;
printf("enter the no. of elements:");
scanf("%d",&n);
pointer=(int*)malloc(n*sizeof(n));
pointer2=(int*)malloc(n*sizeof(n));
for(int k=0,i=0,j=n-1;k<n;k++)
{
scanf("%d",(pointer+k));
if(*(pointer+k))
{
*(pointer2+(j))=*(pointer+k);
j--;
}
else
{
*(pointer2+i)=*(pointer+k);
i++;
}
}
for(i=0;i<n;i++)
printf("%d ",*(pointer2+i));
getch();
}


thaank u

I Hope this will also work for this question.
I just took it for length of 8 but we can extend it to any
level.

void swap(int* p, int x, int y)
{
   int tmp;
   tmp  = *(p+x);
   *(p+x) = *(p+y);
   *(p+y) = tmp;
}
int main()
{
   int* ptr = (int*)malloc(sizeof(8));
   int c, i, j;

   for(c=0; c<8 ; c++) scanf("%d", ptr+c);

   for(i=0; i<8; i++)
   {
      for(j=0; j<8; j++)
      {
         if( *(ptr+j) > *(ptr+j+1) ) swap(ptr, j, j+1);
      }
   }

   for(c=0;c<8;c++) printf("%d", *(ptr+c));
   return 0;
}

good morning sir,

in ur above program , u said u took then length as 8 and
then allocated ur memory using DMA... but ur way of
allocation find to be wrong sir.... as you allocated

int *ptr=(int*)malloc(sizeof(8));

the above statement will allocate only 2 bytes for  u....
since you have given 8 inside sizeof operator..  this will
tell the compiler allocate 2 bytes of memory ..  ur
instruction must be :

int *ptr=(int*)malloc(8*sizeof(int));

so, then it will allocate 8*2 bytes of memory sir..... 

so only in my program i have given  n*sizeof(int) , where
'n' can be any value that user gives........


thank u

This program will work perfectly. I hope this is the exact
answer to the question.

#include<stdio.h>

void swap(int *a, int *b)
{
int temp;
temp = *b;
*b=*a;
*a=temp;
}

int main()
{
int a[]={0,0,1,0,1,1,0,0};
int i,j;

for(i=0;i<8;i++)
{
  if(a[i])
  {     
    j=i+1;
   while(j<8)
   { 
     j++;
     if(!a[j])
     {            
	swap(&a[i],&a[j]);
	break;
     }	
   }
	
  }
}
 
for(i=0;i<8;i++)
 printf("%d ",a[i]);

return;
}

#include <stdio.h>

int main() {
    int a[8] = {1,0,1,0,1,0,0,1};
    int i = 0,j=0;
    int sorted = 1;
    for(i=0;i<8;i++) {
        if (a[i]) continue;
         /* Find the nearest one and swap */
         for(j=i+1;j<8;j++) {
             if (a[j]) {
                 a[j] = a[i] + a[j];
                 a[i] = a[j] - a[i];
                 a[j] = a[j] - a[i];
                 sorted = 0;
                 break;      
             }
         }
         if (sorted) { break;} 
    }
    printf("\nSorted Array is { ");
    for (i=0;i<8;i++) { printf("%d,",a[i]); }
    printf("}\n");
}

#include<stdio.h>
#include<conio.h>
void main()
{
int a[]={0,0,1,0,1,1,0,0};
int t,j=0,k=0;
while(a[j]!='\0')
{
if(a[j]==1)
j++;

if(a[k]==0)
k++;

t=i;
a[i]=a[j];
a[j]=a[t];

printf("%d",a[j]);
}
}

#include<stdio.h>
#include<conio.h>
void main()
{
int a[]={0,0,1,0,1,1,0,0};


int *arrayTemp = a;


int i, j_0 = 0, j_8 = 8;

for(int data = 0; *a != '\0'; *a++)
{

data = *a;
if(data == 1 )
{
   a[j_0++] = data;
}
else
{
   a[j_8--] = data;
} // if-else block

}//for loop

}//main function

for(i=0; i< 8; i ++)
{

 printf("array value is %d", a[i]);
 
}