<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fibonacci on Jerry Yang's Blog</title><link>https://blog.yangjerry.tw/tags/fibonacci/</link><description>Recent content in Fibonacci on Jerry Yang's Blog</description><generator>Hugo -- gohugo.io</generator><language>zh-TW</language><managingEditor>youremail@example.com (ChengHao Yang)</managingEditor><webMaster>youremail@example.com (ChengHao Yang)</webMaster><copyright>© 2018–2025 ChengHao Yang. 除另有標示外，本站文章皆以 [CC BY-SA 4.0](https://creativecommons.org/licenses/by-sa/4.0/legalcode.zh-hant) 授權釋出</copyright><lastBuildDate>Thu, 31 Jan 2019 13:15:00 +0800</lastBuildDate><atom:link href="https://blog.yangjerry.tw/tags/fibonacci/atom.xml" rel="self" type="application/rss+xml"/><item><title>O(1)的費氏數列？公式解就一定是O(1)？</title><link>https://blog.yangjerry.tw/posts/fibonacci-is-bigo1/</link><pubDate>Thu, 31 Jan 2019 13:15:00 +0800</pubDate><author>youremail@example.com (ChengHao Yang)</author><guid>https://blog.yangjerry.tw/posts/fibonacci-is-bigo1/</guid><description><![CDATA[<p>我在撰寫此貼文時，原留言者已經刪留言了，反正就是說「費氏數列有公式解，複雜度就是$O(1)$」</p><p><a href="https://blog.yangjerry.tw/posts/fibonacci-is-bigo1/">點擊閱讀完整內容 →</a></p>]]></description></item></channel></rss>