DS-SDUT-数据结构实验之排序二：交换排序

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int n;
long long ls[100010];
long long  s[100010];
int num1, num2;
void mao(long long a[])
{
    int i, j;
    for( i = 0; i < n-1; i++)
    {
        for(j = 0; j < n-i-1; j++)
        {
            if(a[j] > a[j+1])
            {
                long long t = a[j];
                a[j] = a[j+1];
                a[j+1] = t;
                num1++;
            }
        }
    }
}
void qsort(int l, int r, long long a[])
{
    long long key = a[l];
    int i = l, j = r;
    if(l >= r)
        return ;
    while(i < j)
    {
        while(i < j&& key<=a[j])
            j--;
        if(i != j)
        {
            a[i] = a[j];
            num2++;
        }

        while(i < j&& key >= a[i]) i++;
        if(i!=j)
        {
            a[j] = a[i];
            num2++;
        }
    }
    a[i] = key;
    qsort(l,i-1,a);
    qsort(i+1,r,a);
}
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i = 0; i < n; i++)
        {
            scanf("%lld",&ls[i]);
            s[i] = ls[i];
        }
        num1 = num2 = 0;
        mao(ls);
        qsort(0,n-1,s);
        printf("%d %d\n",num1,num2);
    }
    return 0;
}