排序VS比较简介

#include <stdio.h>

typedef struct _tag_DataElem{
	char* desc;
	int key1;
	int key2;
}DataElem;

int compare1(DataElem* first,DataElem* second)
{
	int ret = 0;
	if(first->key1 > second->key1){
		ret = 1;
	}else if(first->key1 == second->key1){
		if(first->key2 > second->key2){
			ret = 1;
		}else if(first->key2 < second->key2){
			ret = -1;
		}else{
			ret = 0;
		}
	}else{
		ret = -1;
	}
	
	return ret;
}

int compare2(DataElem* first,DataElem* second)
{
	return ((first->key1 * 100 + first->key2) - (second->key1 * 100 + second->key2));	
}

int main()
{
	DataElem d1 = {"Zhenjun",98,95};
	DataElem d2 = {"Yiran",99,99};
	
	int result1 = compare1(&d1,&d2);
	int result2 = compare2(&d1,&d2);
	
	printf("By the Compare1:\n");
	if(result1 > 0){
		printf("%s is better than %s\n",d1.desc,d2.desc);
	}else if(result1 < 0){
		printf("%s is better than %s\n",d2.desc,d1.desc);
	}else{
		printf("%s is same as %s\n",d1.desc,d2.desc);
	}
	
	printf("By the Compare2:\n");
	if(result2 > 0){
		printf("%s is better than %s\n",d1.desc,d2.desc);
	}else if(result2 < 0){
		printf("%s is better than %s\n",d2.desc,d1.desc);
	}else{
		printf("%s is same as %s\n",d1.desc,d2.desc);
	}
}

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值