private void swap(int[] array, int a, int b) {
    int temp = array[a];
    array[a] = array[b];
    array[b] = temp;
  }
Second implementation for this problem. This implementation is better than the previous one
because we have reduced the complexity order of this algorithm in time terms from O(N^2) to
O(N). The complexity order in space terms is the same.
src/main/java/com/github/pedrovgs/problem12/MoveZerosInArray.java