SIMPLE AND EASY RECURSION APROACH || C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    // Recursive function to find the minimum added integer\n    void rec(int idx1, int idx2, vector<int>& nums1, vector<int>& nums2, int &ans, int x, int del) {\n        // Base case: when idx2 reaches the end of nums2\n        if (idx2 == nums2.size()) {\n            ans = min(ans, x); // Update the answer with the minimum value\n            return;\n        }\n        \n        // If del is less than or equal to 1, try removing one element from nums1\n        if (del <= 1)\n            rec(idx1 + 1, idx2, nums1, nums2, ans, x, del + 1);\n        \n        // Check if the difference between nums2[idx2] and nums1[idx1] is equal to x\n        if (nums2[idx2] - nums1[idx1] == x)\n            rec(idx1 + 1, idx2 + 1, nums1, nums2, ans, x, del); // Recur with updated indices\n        \n        // If the difference condition is not satisfied, return\n        else\n            return;\n    }     \n    \n    // Function to find the minimum added integer\n    int minimumAddedInteger(vector<int>& nums1, vector<int>& nums2) {\n        sort(nums1.begin(), nums1.end()); // Sort nums1 in non-decreasing order\n        sort(nums2.begin(), nums2.end()); // Sort nums2 in non-decreasing order\n        \n        int ans = INT_MAX; // Initialize answer to maximum possible value\n        // Try the first three elements of nums1 as potential starting points\n        for (int i = 0; i < 3; i++) {\n            rec(i, 0, nums1, nums2, ans, nums2[0] - nums1[i], i); // Call the recursive function\n        }\n        return ans; // Return the minimum added integer\n    }\n};\n\n```
['Recursion', 'Sorting', 'C++']