CareerCup How would you implement a secondary sorting

本文探讨了三种实现二级排序的方法:按A类别排序后再按B子类别排序。第一种方法是在A排序后,对相同A值的元素按B排序;第二种方法是使用比较函数同时按A和B排序;第三种方法是先稳定排序B再排序A。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

how would you implement a secondary sorting. Meaning sorting by Category A, and then sub sorting by category B?

--------------------------------------------------------------------------


Three approaches come to mind. 
1) Sort on A, then scan the list for runs of elements with the same value for A, then sort each sublist for field B. 
2) Sort on A/B simultaneously by using a compare function or key function that uses both fields. 
3) Sort the list on B, then stable-sort the list on A. 

A nice feature of approach #1 is that you can do it lazily, i.e. only sort the sublists when the second field is queried.



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值