Latest DATA STRUCTURE Aptitude Question SOLUTION: EXAMPLE: Input=['1','0','1','2','3','0','3','4','0'] Output: ['1', '1', '2', '3', '3', '4', '0', '0', '0'] // Function to move all zeros present in the array to the end void reor

• Placement Papers
• /
• DATA STRUCTURE
• /
• Programming

DATA STRUCTURE Question Papers:

(#M40167068) DATA STRUCTURE Programming question Move all zeros present in an array to the end Keep an EYE

EXAMPLE:
Input=['1','0','1','2','3','0','3','4','0']
Output:
['1', '1', '2', '3', '3', '4', '0', '0', '0']

// Function to move all zeros present in the array to the end
void reorder(int A[], int n)
{
// k stores index of next available position
int k = 0;

// do for each element
for (int i = 0; i < n; i++)
{
// if current element is non-zero, put the element at
// next free position in the array
if (A[i] != 0)
A[k++] = A[i];
}

// move all 0's to the end of the array (remaining indices)
for (int i = k; i < n; i++)
A[i] = 0;
}

// Move all zeros present in the array to the end
int main(void)
{
int A[] = { ..... };
int n = sizeof(A) / sizeof(A[0]);

reorder(A, n);

for (int i = 0; i < n; i++)
printf("%d ", A[i]);

return 0;
}

Asked In DATA STRUCTURE SUDHEER BABU PALLANTI (3 years ago)

Unsolved

Is this Puzzle helpful?   (2)   (0) Submit Your Solution