算法导论Problems 2-4: Inversions

最新推荐文章于 2020-11-05 23:33:01 发布

逃亡的山猫

最新推荐文章于 2020-11-05 23:33:01 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法文章标签：算法 permutation vector iostream merge algorithm

本文链接：https://blog.csdn.net/quantao0308/article/details/6184716

数据结构与算法专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种基于归并排序算法修改的方法来高效计算数组中的逆序数个数。通过调整归并排序过程，可以在O(n log n)的时间复杂度内完成计算，适用于大数据集的逆序数统计。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

算法导论上Problems 2-4是一道求逆序数个数的问题，原题目是这样的：

Let A[1 ‥ n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A.

List the five inversions of the array 〈2, 3, 8, 6, 1〉.
What array with elements from the set {1, 2, . . . , n} has the most inversions? How many does it have?
What is the relationship between the running time of insertion sort and the number of inversions in the input array? Justify your answer.
Give an algorithm that determines the number of inversions in any permutation on n elements in Θ(n lg n) worst-case time. (Hint: Modify merge sort.)

下面是根据题目提示，修改归并排序后的代码

        1: #include <iostream>

       2: #include <vector>

       3: using namespace std;

       4:  

       5: template<typename T>

       6: int mergeInversions(vector<T>& array,vector<T>& tempArray,int left,int mid,int right)

       7: {

       8:     int l = left,r = mid+1;

       9:     int i =l;

    int count=0;

  

    while(l<=mid&&r<=right)

    {

        //if a inversion found

        if(array[l]>array[r])

        {

            //In left section ,for all the elements right to array[l], counter will count.    

            count+=mid-l+1;    

        }

  

        if(array[l]<=array[r])

            tempArray[i++] = array[l++];

        else

            tempArray[i++] = array[r++];

    }

  

    //copy the remaining elements in L and R to tempArray. 

    while(l<=mid)

        tempArray[i++]= array[l++];

    while (r<=right)

        tempArray[i++] = array[r++];

    //copy the sorted elements back to the original array.

    for(i=left;i<=right;i++)

        array[i] = tempArray[i];

    return count;

}

  

template<typename T>

int countInversions(vector<T>& array,vector<T>& tempArray,int left,int right)

{

    int count = 0;

    if(left < right)

    {

        int mid = (left + right)/2;

        count += countInversions(array,tempArray,left,mid);

        count += countInversions(array,tempArray,mid+1,right);

        count += mergeInversions(array,tempArray,left,mid,right);

    }

    return count;

}

  

template<typename T>

int countInversions(vector<T>& array)

{

    vector<T> tempArray(array.size());//A auxiliary vector will be used in merge function.

    return countInversions(array,tempArray,0,array.size()-1);

}

  

int main()

{

    vector<int> array(5);

    array[0]= 5;

    array[1]= 4;

    array[2]= 3;

    array[3]= 2;

    array[4]= 1;

    cout<<"Number of inversions:";

    cout<<countInversions<int>(array)<<endl;

}