Question: Which of the following statement is false about this computational problem. move all the zeros in array of n number to the left end of the array  Edit

Answer: Without creating a new array you can iterate over your current array backwards and when you encounter a zero swap it with the last element of your array. You'll need to keep a count of the number of zero elements swapped so that when you swap for a second time, you swap with the last-1 element, and so forth.
[D] This problem can be solved by an algorithm in logn step or operation
  Edit