```python
def re_order(A):
    """
    Moves all zeroes to the end of the given array in-place.
    The relative order of the non-zero elements is maintained.
    """
    # This pointer indicates the position where the next non-zero element should be placed.
    last_non_zero_found_at = 0
    
    # Iterate through the array.
    for i in range(len(A)):
        # If the current element is not zero,
        if A[i] != 0:
            # Swap the current element with the element at the last_non_zero_found_at index.
            A[last_non_zero_found_at], A[i] = A[i], A[last_non_zero_found_at]
            # Move the pointer for the next non-zero element.
            last_non_zero_found_at += 1
```