diff --git a/sorting/count_inversions.cpp b/sorting/count_inversions.cpp
index 997878f05..42d26b8c6 100644
--- a/sorting/count_inversions.cpp
+++ b/sorting/count_inversions.cpp
@@ -144,6 +144,7 @@ uint64_t mergeSort(T* arr, T* temp, uint64_t left, uint64_t right) {
  * present in the input array. Inversions are an estimate of
  * how close or far off the array is to being sorted.
  *
+ * @details
  * Number of inversions in a sorted array is 0.
  * Number of inversion in an array[1...n] sorted in
  * non-ascending order is n(n-1)/2, since each pair of elements