排序算法测试-快速排序

1、测试代码

#include <iostream>

using namespace std;
int g_loop = 0;    /* 循环计数 */
int g_move = 0;    /* 数据移动次数 */

void output_info(int *buff,int len, int flag)
{
    int i;

    if(0 == flag)
    {
        cout << "before: ";
    }
    else
    {
        cout << "after:  ";
    }

    for(i = 0; i < len; ++i)
    {
        cout << *(buff + i) << " ";
    }

    cout << endl;
}

/* 快速排序 */
void fast_sort(int *buff, int left, int right)
{
    if(left >= right)
    {
        return;
    }

    int i = left;
    int j = right;
    int key = buff[left];

    ++g_loop;
    cout << "left=" << left << " right=" << right << endl;

    while(i < j)
    {
        while(i < j && key <= buff[j])
        {
            j--;
        }

        output_info(buff, 10, 0);
        buff[i] = buff[j];
        output_info(buff, 10, 1);
        cout << "j=" << j << endl;

        while(i < j && key >= buff[i])
        {
            i++;
        }

        output_info(buff, 10, 0);
        buff[j] = buff[i];
        output_info(buff, 10, 1);
        cout << "i=" << i << endl;

        ++g_move;
    }

    buff[i] = key;
    output_info(buff, 10, 1);
    cout << endl << endl;

    fast_sort(buff, left, i - 1);
    fast_sort(buff, i + 1, right);
}

int main(void)
{
    int array[10]= {10,9,8,7,6,5,4,3,2,1};

    fast_sort(array, 0, 9);

    cout << endl;
    cout << "move=" << g_move << endl;
    cout << "loop=" << g_loop << endl;

    return 0;
}

2、测试Log 

left=0 right=9
before: 10 9 8 7 6 5 4 3 2 1
after:  1 9 8 7 6 5 4 3 2 1
j=9
before: 1 9 8 7 6 5 4 3 2 1
after:  1 9 8 7 6 5 4 3 2 1
i=9
after:  1 9 8 7 6 5 4 3 2 10

left=0 right=8
before: 1 9 8 7 6 5 4 3 2 10
after:  1 9 8 7 6 5 4 3 2 10
j=0
before: 1 9 8 7 6 5 4 3 2 10
after:  1 9 8 7 6 5 4 3 2 10
i=0
after:  1 9 8 7 6 5 4 3 2 10

left=1 right=8
before: 1 9 8 7 6 5 4 3 2 10
after:  1 2 8 7 6 5 4 3 2 10
j=8
before: 1 2 8 7 6 5 4 3 2 10
after:  1 2 8 7 6 5 4 3 2 10
i=8
after:  1 2 8 7 6 5 4 3 9 10

left=1 right=7
before: 1 2 8 7 6 5 4 3 9 10
after:  1 2 8 7 6 5 4 3 9 10
j=1
before: 1 2 8 7 6 5 4 3 9 10
after:  1 2 8 7 6 5 4 3 9 10
i=1
after:  1 2 8 7 6 5 4 3 9 10

left=2 right=7
before: 1 2 8 7 6 5 4 3 9 10
after:  1 2 3 7 6 5 4 3 9 10
j=7
before: 1 2 3 7 6 5 4 3 9 10
after:  1 2 3 7 6 5 4 3 9 10
i=7
after:  1 2 3 7 6 5 4 8 9 10


left=2 right=6
before: 1 2 3 7 6 5 4 8 9 10
after:  1 2 3 7 6 5 4 8 9 10
j=2
before: 1 2 3 7 6 5 4 8 9 10
after:  1 2 3 7 6 5 4 8 9 10
i=2
after:  1 2 3 7 6 5 4 8 9 10

left=3 right=6
before: 1 2 3 7 6 5 4 8 9 10
after:  1 2 3 4 6 5 4 8 9 10
j=6
before: 1 2 3 4 6 5 4 8 9 10
after:  1 2 3 4 6 5 4 8 9 10
i=6
after:  1 2 3 4 6 5 7 8 9 10

left=3 right=5
before: 1 2 3 4 6 5 7 8 9 10
after:  1 2 3 4 6 5 7 8 9 10
j=3
before: 1 2 3 4 6 5 7 8 9 10
after:  1 2 3 4 6 5 7 8 9 10
i=3
after:  1 2 3 4 6 5 7 8 9 10

left=4 right=5
before: 1 2 3 4 6 5 7 8 9 10
after:  1 2 3 4 5 5 7 8 9 10
j=5
before: 1 2 3 4 5 5 7 8 9 10
after:  1 2 3 4 5 5 7 8 9 10
i=5
after:  1 2 3 4 5 6 7 8 9 10

move=9
loop=9

3、算法分析 

• 原地排序算法；
• 非稳定排序算法；
• 空间复杂度 O（logn）；
• 时间复杂度 O（nlogn）。