求能对结构体数组中元素排序的mfc函数

[microtan0902]

typedef struct
{
CString m_sWord;
BYTE m_bCode0;
BYTE m_bCode1;
BYTE m_bCode2;
long m_lFreq;
int m_iNext;
CString m_codebit;
}WordType;

CArray<SequenceType,SequenceType>seqArray;

求函数能对seqArray数组中的m_lfreq进行排序。

[Reesoft]

试试stl的set容器吧：set<Key, Compare, Alloc>

Example
struct ltstr
{
bool operator()(const char* s1, const char* s2) const
{
return strcmp(s1, s2) < 0;
}
};

int main()
{
const int N = 6;
const char* a[N] = {"isomer", "ephemeral", "prosaic",
"nugatory", "artichoke", "serif"};
const char* b[N] = {"flat", "this", "artichoke",
"frigate", "prosaic", "isomer"};

set<const char*, ltstr> A(a, a + N);
set<const char*, ltstr> B(b, b + N);
set<const char*, ltstr> C;

cout << "Set A: ";
copy(A.begin(), A.end(), ostream_iterator<const char*>(cout, " "));
cout << endl;
cout << "Set B: ";
copy(B.begin(), B.end(), ostream_iterator<const char*>(cout, " "));
cout << endl;

cout << "Union: ";
set_union(A.begin(), A.end(), B.begin(), B.end(),
ostream_iterator<const char*>(cout, " "),
ltstr());
cout << endl;

cout << "Intersection: ";
set_intersection(A.begin(), A.end(), B.begin(), B.end(),
ostream_iterator<const char*>(cout, " "),
ltstr());
cout << endl;

set_difference(A.begin(), A.end(), B.begin(), B.end(),
inserter(C, C.begin()),
ltstr());
cout << "Set C (difference of A and B): ";
copy(C.begin(), C.end(), ostream_iterator<const char*>(cout, " "));
cout << endl;
}

照着这个例子，你的代码可以这样写：

struct CompareFunc
{
bool operator()(const long l1, const long l2) const
{
return l1 > l2;
}
};

set<WordType, CompareFunc> setArray;

//未测试过，不知能不能跑:-)

[Reesoft]

搞错了，应该这样写：

struct CompareFunc
{
bool operator()(const WordType wt1, const WordType wt2) const
{
return wt1.m_lFreq > wt2.m_lFreq;
}
};

set<WordType, CompareFunc> setArray;

set容器会自动对其中的元素进行排序，如果要包含重复的元素，请用multiset容器。

[microtan0902]

请问楼上内部实现的排序是什么排序算法？时间复杂度如何？thx