mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-13 15:37:06 +08:00
Update sorting/count_inversions.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
@@ -80,10 +80,10 @@ namespace inversion {
|
||||
*/
|
||||
template <typename T>
|
||||
uint64_t merge(T* arr, T* temp, uint64_t left, uint64_t mid, uint64_t right) {
|
||||
uint64_t i = left; /* i --> index of left sub-array */
|
||||
uint64_t j = mid + 1; /* j --> index for right sub-array */
|
||||
uint64_t k = left; /* k --> index for resultant array temp */
|
||||
uint64_t inv_count = 0; // inversion count
|
||||
uint32_t i = left; /* i --> index of left sub-array */
|
||||
uint32_t j = mid + 1; /* j --> index for right sub-array */
|
||||
uint32_t k = left; /* k --> index for resultant array temp */
|
||||
uint32_t inv_count = 0; // inversion count
|
||||
|
||||
while ((i <= mid) && (j <= right)) {
|
||||
if (arr[i] <= arr[j]) {
|
||||
|
||||
Reference in New Issue
Block a user