human
Write me a the Python program you requested given the following:
I am working on the file "Python/leetcode/easy/strings-arrays.ipynb".
The first task is:
Q.4. Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Can you write Python program for it?
assistant
#Here is the Python program you requested.

class Solution(object):
    def moveZeroes(self, nums: List[int]) -> None:
        """
        :type nums: List[int]
        :rtype None
        Perform inplace ordering.
        
        Method: Apply a form of insert sort that moves each non-negative value
                to its right place in the list.
        """
        for i in range(len(nums)):
            if nums[i] != 0:
                j = i
                while j > 0 and nums[j - 1] == 0:
                    nums[j], nums[j-1] = nums[j-1], nums[j]
                    j -= 1

nums = [0,1,0,3,12]
Solution().moveZeroes(nums)
print(nums)