CareerCup

Don't u think its very easy!!
int index=-1;//index where the first zero has occured

for(i=0;i<n;i++){
if(!a[i]){
if(index==-1) index =i;
continue;
}
else{
if(index==-1)continue;
else swap(arr[index],arr[i]);
index++;
}
}

first..remove all zeroes in between d array..(like we remove spaces in a string)..O(n)
keep track of no of zeroes..using a count variable..
second concatenate dis array wid no of zeroes in d original array..

#include<iostream>
using namespace std;

int main()
{
int arr[]={1,0,2,0,3,0,0,4,5,6,7,0,0,0},find,count;
// int arr[]={1,0,2,0,3,0,0,4,5,6,7},find,count;
int i,j;

for(i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
{
j=0;
if(arr[i] == 0)
{
find=i;
j=i;
count++;
while(arr[j] <= 0)
{
j++;
}
if(j !=sizeof(arr)/sizeof(arr[0])) //for boundary condiation checking
{
arr[find]=arr[j] ;
arr[j]=0;
}
}
}
for(i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
cout<<"element ="<<arr[i]<<"\t"<<endl;
}

sorry,count is not required....

#include<iostream>
using namespace std;

int main()
{

    int b[] = {0,0,2,0,3,0,0,4,5,6,7,0,0,8};
    i = 0; j = 1;
    int sizeOfArray = sizeof(b) / sizeof(b[0]);
  
    while(j < sizeOfArray - 1)
    {
           while(b[i] != 0) 
             i++;
             
           while(b[j] ==0) 
             j++;
             
           b[i] = b[j] ;
           b[j] = 0;
           }
   for (int i = 0; i <=  13; i++) 
    { cout << b[i] << " ";}
}

static void Main(string[] args)
        {
            int [] array = {0,0,2,0,3,0,0,4,5,6,7,0,0,8};
          
            int hole = 0;
            for (int j = 0; j < array.Length; j++)
            {
                if (array[j] != 0)
                {
                    array[hole++] = array[j];
                    array[j] = 0;
                }
            }

            Console.WriteLine("\n After Moving zeroes to end...");
            for (int i = 0; i < hole; i++)
                Console.Write(array[i].ToString() + ", ");

}

Do inplace sorting like selection sort or some thing

var nums = new Array(1,0,2,0,3,0,0,4,5,6,7,0,0,0);
	var count = 0;
	for( i=0; i < nums.length; i++ )
	{
		if( nums[i-count]==0 )
		{
			nums.splice(i-count,1);
			//nums.pop();
			count++;
		}
	}

	do {
		nums.push(0);
		count--;
	}
	while( count > 0 );
	
	
	alert( nums);

tr

int main()
{
	int arr[]={1,0,2,0,3,0,0,4,5,6,7,0,0,0},move = 0;

	for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++) {
		if(arr[i] == 0) {
			move++;
		} else if (move > 0) {
			arr[i - move] = arr[i];
			arr[i] = 0;
		}
	}
	for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
		cout<<"element =\t"<<arr[i]<<endl;


//        complexity O(n)
}

hi
cant we use partition algo in quicksort.
i mean with small modification that all the element whether > or < than 0 must come in left of it.

This code is simple...

#include<stdio.h>
int main()
{
    int a[]={1,0,0,2,0,3,0,0,0,4,0,0,5,0,6};
    int i,ni=0,temp;
    for(i=1;i<15;i++)
    {
      if( a[i] )
      {
          while( ni< 15 && a[ni]!= 0 )
          {
                 ni++;
          }
          temp = a[i];
          a[i] = a[ni];
          a[ni]= temp; 
      }
    }
    for(i=0;i<15;i++)
     printf("%d ",a[i]);
    getch();
    return 0;
}

#include<stdio.h>

void Arrange(int a[], int n)
{
	int k = 0;
	for(int i = 0; i < n; i++)
	{
		k = i;
		while(a[k] == 0 && k < n)
			k++;
		if(k == n)
			break;
		if(i != k)
		{
			// 0 was encountered
			a[i] = a[k];
			a[k] = 0;
		}
	}
}
int main()
{
	int a[] = {1,2,0,2,0,3,0,0,0,4,0,0,0,0,0};
	int n = sizeof(a)/sizeof(int);
	Arrange(a,n);
	printf("\n");
	for(int i = 0; i < n; i++)
	{
		printf("%d ",a[i]);
	}
	return 0;
}

int main()
{
int a[13]={1,0,2,0,3,0,4,5,6,0,0,7,0};
int i=0,j=0;
 

for(i=0;i<13;i++)
{
 j=i;
 while(j>=0)
 {
   if(a[j-1]==0){ a[j-1]=a[j];  a[j]=0;  j--;}
   else j--;
 }
}
for(i=0;i<13;i++)
 printf(" %d",a[i]);
return 0;

}