Update adaptive_merge_sort.cpp

i have documented the header
added tparm
added test for negative numbers

Author: anant-jain01

sorting/adaptive_merge_sort.cpp

@@ -5,6 +5,7 @@
  * @details This file contains the implementation of the Adaptive Merge Sort algorithm.
  * The algorithm is a stable, divide-and-conquer based sorting algorithm.
  *
+ * @tparam T Type of elements to be sorted.
  * @see https://medium.com/@kaweendra/the-ultimate-sorting-algorithm-6513d6968420
  */
 
@@ -16,6 +17,7 @@
 
 /**
  * @brief Function to merge two halves of an array
+ * @tparam T Type of elements to be sorted
  * @param array Vector of elements to be sorted
  * @param aux Auxiliary vector used for merging
  * @param low Starting index
@@ -25,7 +27,6 @@
 template <typename T>
 void merge(std::vector<T>& array, std::vector<T>& aux, int low, int mid, int high) {
     std::copy(array.begin() + low, array.begin() + high + 1, aux.begin() + low);
-
     int i = low;
     int j = mid + 1;
     for (int k = low; k <= high; ++k) {
@@ -43,6 +44,7 @@ void merge(std::vector<T>& array, std::vector<T>& aux, int low, int mid, int hig
 
 /**
  * @brief Function to recursively sort an array using Adaptive Merge Sort
+ * @tparam T Type of elements to be sorted
  * @param array Vector of elements to be sorted
  * @param aux Auxiliary vector used for merging
  * @param low Starting index
@@ -51,7 +53,6 @@ void merge(std::vector<T>& array, std::vector<T>& aux, int low, int mid, int hig
 template <typename T>
 void sort(std::vector<T>& array, std::vector<T>& aux, int low, int high) {
     if (low >= high) return;
-
     int mid = low + (high - low) / 2;
     sort(array, aux, low, mid);
     sort(array, aux, mid + 1, high);
@@ -60,13 +61,13 @@ void sort(std::vector<T>& array, std::vector<T>& aux, int low, int high) {
 
 /**
  * @brief Function to sort an array using Adaptive Merge Sort algorithm
+ * @tparam T Type of elements to be sorted
  * @param array Vector of elements to be sorted
  * @return Vector of sorted elements
  */
 template <typename T>
 std::vector<T> adaptiveMergeSort(std::vector<T> array) {
     if (array.size() <= 1) return array;
-
     std::vector<T> aux(array.size());
     sort(array, aux, 0, array.size() - 1);
     return array;
@@ -100,6 +101,11 @@ void testAdaptiveMergeSort() {
     std::vector<int> single = {42};
     std::vector<int> expectedSingle = {42};
     assert(adaptiveMergeSort(single) == expectedSingle);
+    
+    // Test negative numbers
+    std::vector<int> negatives = {-3, -1, -7, -4, -6, -2, -5};
+    std::vector<int> expectedNegatives = {-7, -6, -5, -4, -3, -2, -1};
+    assert(adaptiveMergeSort(negatives) == expectedNegatives);
 
     std::cout << "All AdaptiveMergeSort tests passed!" << std::endl;
 }