泛型快速排序

Source

#ifndef kimi_quicksort

#define kimi_quicksort

 

#include <functional>

#include <iterator>

#include <algorithm>

 

 

namespace kimi_boost

{

 

using namespace std;

 

template<class RandomAccessIterator>

void quicksort(RandomAccessIterator first, RandomAccessIterator last)

{

       //>= and <= operator

       typedef greater_equal<

              typename iterator_traits<RandomAccessIterator>::value_type >

              Compare1;

 

       typedef less_equal<

              typename iterator_traits<RandomAccessIterator>::value_type >

              Compare2;

 

    if (distance(first,last) <= 1) return;

    RandomAccessIterator i = first, j = last-1, n = first;

 

       //partition

    while (i < j)

    {

        while (i < j && Compare1()(*j,*n) ) --j;

        iter_swap(n, j);

        n = j;

        while (i < j && Compare2()(*i,*n) ) ++i;

        iter_swap(n, i);

        n = i;

    }

 

       //递归

       if(first != n)

              quicksort(first, n - 1);

       if(n != last)

              quicksort(n + 1, last);

}

 

}

#endif//kimi_quicksort

Test code

void loki_pool_test2()

{

       std::vector<unsigned> vi;

       std::deque<unsigned> di;

 

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

       vi.push_back(rand());

 

       di.assign(vi.begin(), vi.end());

 

 

       kimi_boost::quicksort(vi.begin(), vi.end());

       copy(vi.begin(), vi.end(), ostream_iterator<unsigned>(cout," "));

       cout<<endl;

       kimi_boost::quicksort(di.begin(), di.end());

       copy(di.begin(), di.end(), ostream_iterator<unsigned>(cout," "));

}

Output

41 5705 6334 11478 15724 18467 19169 24464 26962 28145 26500 29358

41 5705 6334 11478 15724 18467 19169 24464 26962 28145 26500 29358

 
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值