猴子排序的简单实现 - V2EX

Home Sign Up Sign In

V2EX = way to explore

V2EX 是一个关于分享和探索的地方

Sign Up Now

For Existing Member Sign In

DataPacket

CDN77

This topic created in 2495 days ago, the information mentioned may be changed or developed.

前几天有点闲，用 js 写了一下猴子排序（花畑佳子排序法）比较简陋，轻喷

检验血统吧！！

5 replies • 2019-07-09 16:03:16 +08:00

1

Trim21

Jun 30, 2019 via Android

233 排序只能手动点真是要累死人了

2

threebr

Jun 30, 2019

如果猴子排序对了能够高亮标注出来就更好了

3

kaedea

Jun 30, 2019 via Android

时间复杂度怎么算

4

gerardyang

OP

Jun 30, 2019 via Android

@kaedea O(1)~O(infinity)
因为是猴子（

5

PoetAndPoem

Jul 9, 2019

@threebr 代码里有 equar 函数，调用下就可以了

About · Help · Advertise · Blog · API · FAQ · Solana · 951 Online Highest 6679 ·

Select Language

创意工作者们的社区

World is powered by solitude

VERSION: 3.9.8.5 · 32ms · UTC 20:24 · PVG 04:24 · LAX 13:24 · JFK 16:24
♥ Do have faith in what you're doing.