public void moveSorting(int[] array) {
    validateArray(array);

    boolean swap = true;
    while (swap) {
      swap = false;
      for (int i = 0; i < array.length - 1; i++) {
        if (array[i] == 0 && array[i + 1] != 0) {
          swap(array, i, i + 1);
          swap = true;
        }
      }
    }
  }
Algorithm implementation based on a sorting algorithm named "Bubble Sorting" modified to work
with this problem requirements. Using this sorting algorithm we get a complexity order in time
terms equals to O(N^2) where N is the number of elements in the array. In space terms, the
complexity order of this algorithm is O(1).
src/main/java/com/github/pedrovgs/problem12/MoveZerosInArray.java