如何排序 MFC的CStringArray

None.gif #define _AFXDLL
None.gif#include
< afx.h >
None.gif#include
< afxcoll.h >
None.gif#include
< iostream >
None.gif
using namespace std;
None.gif
ExpandedBlockStart.gifContractedBlock.gif
class CSortStringArray: public CStringArray dot.gif {
InBlock.gif
public:
InBlock.gif
voidSort();
InBlock.gif
private:
InBlock.gifBOOLCompareAndSwap(
intpos);
ExpandedBlockEnd.gif}
;
None.gif
void CSortStringArray::Sort()
ExpandedBlockStart.gifContractedBlock.gif
dot.gif {
InBlock.gifBOOLbNotDone
=TRUE;
InBlock.gif
InBlock.gif
while(bNotDone)
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif{
InBlock.gifbNotDone
=FALSE;
InBlock.gif
for(intpos=0;pos<GetUpperBound();pos++)
InBlock.gifbNotDone
|=CompareAndSwap(pos);
ExpandedSubBlockEnd.gif}

ExpandedBlockEnd.gif}

None.gifBOOLCSortStringArray::CompareAndSwap(
int pos)
ExpandedBlockStart.gifContractedBlock.gif
dot.gif {
InBlock.gifCStringtemp;
InBlock.gif
intposFirst=pos;
InBlock.gif
intposNext=pos+1;
InBlock.gif
InBlock.gif
if(GetAt(posFirst).CompareNoCase(GetAt(posNext))>0)
ExpandedSubBlockStart.gifContractedSubBlock.gif
dot.gif{
InBlock.giftemp
=GetAt(posFirst);
InBlock.gifSetAt(posFirst,GetAt(posNext));
InBlock.gifSetAt(posNext,temp);
InBlock.gif
returnTRUE;
InBlock.gif
ExpandedSubBlockEnd.gif}

InBlock.gif
returnFALSE;
ExpandedBlockEnd.gif}

None.gif
void main()
ExpandedBlockStart.gifContractedBlock.gif
dot.gif {
InBlock.gifCSortStringArraysortArray;
InBlock.gifsortArray.Add(CString(
"Zebra"));
InBlock.gifsortArray.Add(CString(
"Bat"));
InBlock.gifsortArray.Add(CString(
"Apple"));
InBlock.gifsortArray.Add(CString(
"Mango"));
InBlock.gif
for(inti=0;i<=sortArray.GetUpperBound();i++)
InBlock.gifcout
<<sortArray[i]<<endl;
InBlock.gif
InBlock.gifsortArray.Sort();
InBlock.gifcout
<<endl;
InBlock.gif
InBlock.gif
for(intj=0;j<=sortArray.GetUpperBound();j++)
InBlock.gifcout
<<sortArray[j]<<endl;
InBlock.gifsystem(
"pause");
ExpandedBlockEnd.gif}

None.gif

参考: How to Sort a CStringArray in MFC<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" />

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值