gerardyang
V2EX  ›  编程

猴子排序的简单实现

  •  1
     
  •   gerardyang · Jun 30, 2019 · 7237 views
    This topic created in 2701 days ago, the information mentioned may be changed or developed.

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

    页面
    Github

    检验血统吧!!

    5 replies  •  2019-07-09 16:03:16 +08:00
    Trim21
    Trim21
    Jun 30, 2019 via Android
    1
    233 排序只能手动点真是要累死人了
    threebr
    threebr
    Jun 30, 2019
    2
    如果猴子排序对了能够高亮标注出来就更好了
    kaedea
    kaedea
    Jun 30, 2019 via Android
    3
    时间复杂度怎么算
    gerardyang
    gerardyang
    OP
    Jun 30, 2019 via Android
    4
    @kaedea O(1)~O(infinity)
    因为是猴子(
    PoetAndPoem
    PoetAndPoem
    Jul 9, 2019
    5
    @threebr 代码里有 equar 函数,调用下就可以了
    About   ·   Help   ·   Advertise   ·   Blog   ·   API   ·   FAQ   ·   Privacy   ·   Solana   ·   1165 Online   Highest 6679   ·     Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 · 34ms · UTC 23:55 · PVG 07:55 · LAX 15:55 · JFK 18:55
    ♥ Do have faith in what you're doing.