char a[][6]={"abcd","abcce","abf","abccd"};
qsort(char* a);//这个时候T就是char*了

字符串比大小不是比长度而是把字母一个一个比的，要换成比长度你得自己指定是比长度才行。

对 例如god, dog, good ,goods, best , dest, bet ,beast, cast排序（字母长的排最排后）)

排序后应该是这样的:
bet ,dog, god, best ,cast, dest, beast, goods.

加个函数就可以了吧？是吗？
bool operator>(char* s1,char* s2)
{
    return (strlen(s1)>strlen(s2))
        ||(strlen(s1)==strlen(s2)&&strcmp(s1,s2)>0);
}

差不多吧，你那个SetSmallest我没看明白逻辑，好像不需要第二个参数，另外如果有重复数的时候是否对不太看得明白，另外就是效率问题，是N^2。

myajax95，呵呵，我只会一种排序方法，其他的什么我都没看。
第2个参数其实就是返回值，只是这样可以不用返回，把值写进去

我找本算法书去查查qsort怎么写的。

写了个比较土的，怎么用template default function object给忘了，回头再写一个好点的。

#include <iostream>
#include <algorithm>
using namespace std;

template<class T>
void quicksort(T* tStart, T* tEnd)
{
    T* tPivot;
    if (tStart < tEnd)
    {
        tPivot = partition(tStart, tEnd);
        quicksort(tStart, tPivot);
        quicksort(tPivot+1, tEnd);
    }
}
template<class T>
T* partition(T* tStart, T* tEnd)
{
    T tX = *tStart, *tLeft = tStart, *tRight = tEnd;
    while (1)
    {
        while (!(*tRight < tX || tRight == tLeft))
            tRight --;
        while (*tLeft < tX && tLeft != tRight)
            tLeft ++;
        if (tLeft < tRight)
            swap(*tLeft, *tRight);
        else
            return tRight;
    }
}
struct str
{
public:
    str(char *p) : p_str(p) {}
    operator < (str s) {return strlen(p_str) < strlen(s.p_str);}
    char * p_str;
};
int main()
{
    int intAr[] = {11,13,8,19,-21,32};
    quicksort(&intAr[0], &intAr[5]);
    for (int i = 0; i < 6; i++)
        cout << intAr[i] << endl;
    float fAr[] = {11.2,14.1, -32.254,3.14159265,-2.182818281828,-2.182818281829,35.000};
    quicksort(&fAr[0], &fAr[6]);
    for (i = 0; i < 7; i++)
        cout << fAr[i] << endl;
    str chr[] = {\"god\", \"dog\", \"good\" ,\"goods\", \"best\", \"dest\", \"bet\", \"beast\", \"cast\"};
    quicksort<str>(&chr[0], &chr[8]);
    for (i = 0; i < 9; i++)
        cout << chr[i].p_str << endl;
    
    return 0;
}

用的你的算法，看看还可以吧

[CODE]#include <iostream>
#include <algorithm>
using namespace std;


template<class T> struct less_t
{
bool operator()(T t1, T t2) { return t1 < t2; }
};

struct less_str
{
bool operator()(const char *p, const char*q) { return strcmp(p,q)<0; }
};


template<class T>
void quicksort(T* tStart, T* tEnd) // overloading
{
quicksort(tStart, tEnd, less_t<T>());
}

template<class T,class Comp>
void quicksort(T* tStart, T* tEnd, Comp comp)
{
T* tPivot;

if (tStart < tEnd)
{
tPivot = partition(tStart, tEnd, comp);
quicksort(tStart, tPivot, comp);
quicksort(tPivot+1, tEnd, comp);
}
}

template<class T, class Comp>
T* partition(T* tStart, T* tEnd, Comp comp)
{
T tX = *tStart, *tLeft = tStart, *tRight = tEnd;
while (1)
{
while (!(comp(*tRight, tX) || tRight == tLeft))
tRight --;
while (comp(*tLeft, tX )&& tLeft != tRight)
tLeft ++;

if (tLeft < tRight)
swap(*tLeft, *tRight);
else
return tRight;
}
}

int main()
{
int intAr[] = {11,13,8,19,-21,32};
quicksort(&intAr[0], &intAr[5]);
for (int i = 0; i < 6; i++)
cout << intAr[i] << endl;

float fAr[] = {11.2,14.1, -32.254,3.14159265,-2.182818281828,-2.182818281829,35.000};
quicksort(&fAr[0], &fAr[6]);
for (int i = 0; i < 7; i++)
cout << fAr[i] << endl;

char *chr[] = {"god", "dog", "good" ,"goods", "best", "dest", "bet", "beast", "cast"};
quicksort(&chr[0], &chr[8], less_str());
for (int i = 0; i < 9; i++)
cout << chr[i] << endl;
cin.get();
return 0;
}[/CODE]

头文件应该加 <cstring>
不过不加好象也行？