python用sorted排名_python的sorted()使用什么算法?

Name says it all.

I'm trying to explain to someone why they should use Python's builtin sorted() function instead of rolling their own, and I realized I have no idea what algorithm it uses.

If it matters, we're talking python 2.7

解决方案

Python uses an algorithm called Timsort:

Timsort is a hybrid sorting algorithm, derived from merge sort and

insertion sort, designed to perform well on many kinds of real-world

data. It was invented by Tim Peters in 2002 for use in the Python

programming language. The algorithm finds subsets of the data that are

already ordered, and uses the subsets to sort the data more

efficiently. This is done by merging an identified subset, called a

run, with existing runs until certain criteria are fulfilled. Timsort

has been Python's standard sorting algorithm since version 2.3. It is

now also used to sort arrays in Java SE 7, and on the Android

platform.

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值