350. Intersection of Two Arrays II*

Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].

Note:

• Each element in the result should appear as many times as it shows in both arrays.
• The result can be in any order.

Follow up:

• What if the given array is already sorted? How would you optimize your algorithm?
• What if nums1's size is small compared to nums2's size? Which algorithm is better?
• What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once

My code:     

    def intersection2(self, nums1, nums2):
        pointer1 = 0
        pointer2 = 0
        nums1.sort()
        nums2.sort()
        intersection_set=[]
        while pointer1<len(nums1) and pointer2<len(nums2):
             if nums1[pointer1]<nums2[pointer2]:
                 pointer1 +=1
             elif nums1[pointer1]>nums2[pointer2]:
                 pointer2 +=1
             else:
                 intersection_set.append(nums1[pointer1])
                 pointer1 +=1
                 pointer2 +=1 
        return intersection_set  

Follow up:

     It seems that this algorithm has solved all the problems mentioned.