05 2015 档案

how many different bst given n nodes?
摘要：Reference:http://stackoverflow.com/questions/3042412/with-n-no-of-nodes-how-many-different-binary-and-binary-search-trees-possibRecursion:t(0) = 1t(1)... 阅读全文
posted @ 2015-05-13 17:09 zmiao 阅读(153) 评论(0) 推荐(0) 编辑
install webapp2 on Linux outside google app engine.
摘要：Reference:https://webapp-improved.appspot.com/tutorials/quickstart.nogae.htmlStep 1: install pipStep 2:$ pip install WebOb$ pip install Paste$ pip ins... 阅读全文
posted @ 2015-05-11 10:40 zmiao 阅读(189) 评论(0) 推荐(0) 编辑
how to check if you have TURNIN successfully?
摘要：For example, if I want to check if I have turnin my proj1 of cs130a successfully, I just use this command:ls -l ~cs130a/TURNIN/proj1Then, just check i... 阅读全文
posted @ 2015-05-08 02:52 zmiao 阅读(115) 评论(0) 推荐(0) 编辑
Time Complexity Big-O
摘要：It can be inserted anywhere. Note that if you insert it in the beginning the TC will be O(#s +c), but it is also O(#s+ n). Remember that the TC is an ... 阅读全文
posted @ 2015-05-01 06:45 zmiao 阅读(225) 评论(0) 推荐(0) 编辑