Update README.md

README.md

@@ -116,40 +116,6 @@ int factorial(int n) {
 
 ---
 
-### ✅ Example 2: Merge Sort
-
-**Input:**  
-```cpp
-vector<int> merge_sort(vector<int>& arr) {
-    if (arr.size() <= 1) return arr;
-
-    int mid = arr.size() / 2;
-    vector<int> left(arr.begin(), arr.begin() + mid);
-    vector<int> right(arr.begin() + mid, arr.end());
-
-    left = merge_sort(left);
-    right = merge_sort(right);
-```
-
-**Completion:**  
-```cpp
-    vector<int> result;
-    int i = 0, j = 0;
-
-    while (i < left.size() && j < right.size()) {
-        if (left[i] < right[j]) {
-            result.push_back(left[i++]);
-        } else {
-            result.push_back(right[j++]);
-        }
-    }
-
-    while (i < left.size()) result.push_back(left[i++]);
-    while (j < right.size()) result.push_back(right[j++]);
-
-    return result;
-}
-```
 
 ---