diff --git a/Chapter-10-Sorting-and-Searching/10-1-Sorted-Merge/10-1-Sorted-Merge.cpp b/Chapter-10-Sorting-and-Searching/10-1-Sorted-Merge/10-1-Sorted-Merge.cpp
index 4fe5907..661138a 100644
--- a/Chapter-10-Sorting-and-Searching/10-1-Sorted-Merge/10-1-Sorted-Merge.cpp
+++ b/Chapter-10-Sorting-and-Searching/10-1-Sorted-Merge/10-1-Sorted-Merge.cpp
@@ -44,7 +44,7 @@ void merge(int A[], int N, int B[], int M)
 int main()
 {
     // As an example, we can use:
-    int A[5] = {1, 3, 5, 7, 9};
+    int A[9] = {1, 3, 5, 7, 9};
     int B[4] = {2, 4, 6, 8};
     
     // print arrays before
diff --git a/Chapter-10-Sorting-and-Searching/10-2-Group-Anagrams/10-2-Group-Anagrams.cpp b/Chapter-10-Sorting-and-Searching/10-2-Group-Anagrams/10-2-Group-Anagrams.cpp
index 596a0f4..cfa463a 100644
--- a/Chapter-10-Sorting-and-Searching/10-2-Group-Anagrams/10-2-Group-Anagrams.cpp
+++ b/Chapter-10-Sorting-and-Searching/10-2-Group-Anagrams/10-2-Group-Anagrams.cpp
@@ -28,9 +28,7 @@ void group_anagrams(std::string arr[], int size)
         for (int i = cur_index + 1; i < size; i++) {
             if (anagram_check(arr[cur_index], arr[i])) {
                 cur_index++;
-                std::string temp = arr[i];
-                arr[i] = arr[cur_index];
-                arr[cur_index] = temp;
+                std::swap(arr[i], arr[cur_index]);
             }
         }
         cur_index++;