Solution using Sorting
\nbool ispresent(vector<int>& nums, int val)\n    {\n        for(int i=0;i<nums.size(); i++)\n        {\n            if(nums[i]==val) return true;\n        }\n 
```\nbool ispresent(vector<int>& nums, int val)\n    {\n        for(int i=0;i<nums.size(); i++)\n        {\n            if(nums[i]==val) return true;\n        }\n        return false;\n    }\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        sort(nums1.begin() , nums1.end() );\n        sort(nums2.begin() , nums2.end() );\n        vector<int>v1,v2;vector<vector<int>> ans;\n        for(int i=0;i<nums1.size();i++)\n        {\n            if(ispresent(nums2,nums1[i])==false) v1.push_back(nums1[i]);\n        }\n         for(int i=0;i<nums2.size();i++)\n        {\n            if(ispresent(nums1,nums2[i])==false)  v2.push_back(nums2[i]);\n        }\n        v1.erase( unique( v1.begin(), v1.end() ), v1.end() );\n        v2.erase( unique( v2.begin(), v2.end() ), v2.end() );\n        ans.push_back(v1); ans.push_back(v2);\n        return ans;\n    }\n```
['C', 'Sorting']