STL: <algorithm>中 sort()

/*
 * void sort(Randomlt first, Randomlt last)
 * void sort(Randomlt first, Randomlt last, Compare comp)
 * sort fist to last by ZiDian sort. 
 * the Compare comp is a help funtion
 */ 

#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;

int cmp(char , char);

int main() {
	//sotr(Randomlt first, Randomlt last);
	char str1[] = "alsdfjekxALSDFJEK";
	int n;

	n = strlen(str1);

	cout<<str1<<endl;
	sort(str1, str1 + n);
	cout<<str1<<endl;

	//sort(Randomlt first, Randomlt last, Compare comp);
	char str2[] = "AkasdSKDFNslkdaKf";
	n = strlen(str2);
	cout<<"A a"<<cmp('A', 'a')<<endl;
	cout<<"Z b"<<cmp('Z', 'b')<<endl;
	cout<<"Z Z"<<cmp('Z', 'Z')<<endl;
	cout<<str2<<endl;
	sort(str2, str2 + n, cmp);
	cout<<str2<<endl;

	return 0;
}

int cmp(char a, char b) {

	if (tolower(a) == tolower(b)) {
		return a < b;
	}else {
		return tolower(a) < tolower(b);
	}
}

认识来源:http://blog.csdn.net/killua_hzl/article/details/3887429

http://baike.baidu.com/view/1374853.htm#2

http://wenku.baidu.com/view/e064166daf1ffc4ffe47ac67.html


                
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值