[請益] 資料結構big-O之問題?

作者: alowchun (alow￾N ￾N)   2005-03-17 09:26:29
as title,
最近在讀Horowitz的這本資結,
big-O的部分還是搞不懂,
例題如下:
100n+6=O(n) as
100n+6 <= 101n <

Links booklink

Contact Us: admin [ a t ] ucptt.com