C++|| SORT|| EASY || WITH EXPLANATION
Since we have to minimise the difference between max element of first array and min element of second array we have to find two consecutive element with least d
Since we have to minimise the difference between max element of first array and min element of second array we have to find two consecutive element with least difference. when we find these two element it will always be possible to make nums1 and nums2 as the elements less than max element can be placed in nums1 and element greater than min of nums2 can be placed in nums2.\nSo sort array and find min difference.\n```\nclass Solution {\npublic:\n    int findValueOfPartition(vector<int>& nums) {\n        int n= nums.size();\n        sort(nums.begin(),nums.end());\n        int mini= INT_MAX;\n        for(int i=1; i<n; i++){\n            mini= min(nums[i]-nums[i-1],mini);\n        }\n        return mini;\n        \n    }\n};
['C', 'Sorting']