2021-09-27

WARNING: This article may be obsolete
This post was published in 2021-09-27. Obviously, expired content is less useful to users if it has already pasted its expiration date.

This article is categorized as "Garbage" . It should NEVER be appeared in your search engine's results.

（杂项）

回顾昨天的大改Prismatic/PrismJS全过程

Codemirror迁移工作：

python regex替换：如何只替换指定位置的字符串？

注册了新的shortcode；在admin页面显示所有shortcodes

divide-and-conquer算法

计算[mathjax]x^n[/mathjax]

def power(x, n):
    if n == 0:
        return 1
    else:
        sub = power(x, n // 2)
        sub2 = sub * sub
        if n % 2 == 0:
            return sub2 * sub2
        else:
            return sub2 * x


print(power(2, 15))

各种Fibonacci algorithms

有待后续整理：https://www.nayuki.io/page/fast-fibonacci-algorithms

https://stackoverflow.com/questions/360748/computational-complexity-of-fibonacci-sequence

有关C语言实现Fibonacci算法的代码和思考见：🔗 [2022-02-26 - Truxton's blog] https://truxton2blog.com/2022-02-26/ （注：仅仅实现了一个递归Fibonacci算法，主要内容集中于C语言数组和指针的机制）