From a269a2a9b3656c88de8b1d994e57cd7e0f634dff Mon Sep 17 00:00:00 2001 From: Rakshit Raj Date: Tue, 1 Dec 2020 12:00:16 +0530 Subject: [PATCH] Update sorting/count_inversions.cpp Co-authored-by: David Leal --- sorting/count_inversions.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/sorting/count_inversions.cpp b/sorting/count_inversions.cpp index dbbf0b9ae..997878f05 100644 --- a/sorting/count_inversions.cpp +++ b/sorting/count_inversions.cpp @@ -140,7 +140,7 @@ uint64_t mergeSort(T* arr, T* temp, uint64_t left, uint64_t right) { } /** - * Funtion countInversion() returns the number of inversion + * @brief Function countInversion() returns the number of inversion * present in the input array. Inversions are an estimate of * how close or far off the array is to being sorted. *