gerardyang
V2EX  ›  编程

猴子排序的简单实现

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

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

    页面
    Github

    检验血统吧!!

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