Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given an integer array nums, and you can perform the following operation any number of times on nums:

Swap the positions of two elements nums[i] and nums[j] if gcd(nums[i], nums[j]) > 1 where gcd(nums[i], nums[j]) is the greatest common divisor of nums[i] and nums[j].

Return true if it is possible to sort nums in non-decreasing order using the above swap method, or false otherwise.
 
Please complete the following python code precisely:
```python
class Solution:
    def gcdSort(self, nums: List[int]) -> bool:
```