Master Theorem on Recursion
Given $$T[n]=\sum a_i T[n/b_i]+f(n),\quad a_i>0, b_i>1,$$ we want to find asymptotic expression for $T[n]$
Given $$T[n]=\sum a_i T[n/b_i]+f(n),\quad a_i>0, b_i>1,$$ we want to find asymptotic expression for $T[n]$
Suppose there are $n$ numbers, use Quickselect to determine $k$-th smallest number. What is average runtime?
由于openSUSE软件更新实在太慢以及对双显卡支持太差,暑假研究了下其他的滚动Linux发行版。以下是对比:
Also on Github Gist
This is my note of reading network programming chapter of CSAPP Book