Update sorting/count_inversions.cpp

Co-authored-by: David Leal <halfpacho@gmail.com>
2026-05-08 23:23:05 +08:00 · 2020-12-02 23:31:10 +05:30
parent d54a285f8d
commit 887787f516
1 changed files with 1 additions and 0 deletions
--- a/sorting/count_inversions.cpp
+++ b/sorting/count_inversions.cpp
@@ -145,6 +145,7 @@ uint64_t mergeSort(T* arr, T* temp, uint64_t left, uint64_t right) {
 * how close or far off the array is to being sorted.
 *
 * @details
+ * @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