求一个数组中的逆序个数

最新推荐文章于 2020-01-20 18:54:32 发布

ksharp2008

最新推荐文章于 2020-01-20 18:54:32 发布

阅读量556

点赞数

文章标签： merge

本文链接：https://blog.csdn.net/ksharp2008/article/details/2159376

版权

int count(int *a,int *tmp,int left,int right);
int merge_count(int *a,int *tmp,int left,int middle,int right);
int count(int *a,int left,int right)
{

int tmp[50];
return count(a,tmp,left,right);

};

int count(int *a,int *tmp,int left,int right)
{
   int all=0;
   if(left<right)
   {
     int middle=(left+right)/2 ;
     int result1,result2;
     result1=count(a,tmp,left,middle);
     result2=count(a,tmp,middle+1,right);
     all=merge_count(a,tmp,left,middle, right);
     return all=all+result1+result2;
   }
   return all;
}

int merge_count(int *a,int *tmp,int left,int middle,int right)
{
   int leftend=middle;
   middle++;
   int count=0;
   int temppos=left;
   int num=right-left+1;
   while(left<=leftend&&middle<=right)
   {
      if(a[left]<a[middle])
        tmp[temppos++]=a[left++];
      else{
        count=count+(leftend-left+1);
        tmp[temppos++]=a[middle++]; }
   }
    while(left<=leftend)
     tmp[temppos++]=a[left++];
    while(middle<=right)
     tmp[temppos++]=a[middle++];
   for(int i=0;i<num;i++)
   {
      a[right]=tmp[right];
      right--;
   }
   return count;
}