Cache Friendly Binary Search: cache 友好的二分搜索
int eytzinger ( int i = 0 , int k = 1 ) { if (k <= n) {i = eytzinger(i, 2 k);b[k] = a[i ++ ];i = eytzinger(i, 2 k + 1 );} return i;} 在eytzinger 布局上的二分搜索实现 const int n = ( 1 … 
梯度下降优化算法简单总结
Kick Start 2020 Round A 题解
Kickstart 2019 Round H
现代多核计算机体系结构简介
PageRank 算法简介
for i in range(MAX_ITERS):r_dict[cur] = sc . pickleFile(DEG_IN) . mapValues( lambda in_nodes: sum(list(map( lambda e : r_dict[cur ^ 1 ][e] / no_degs[e],in_nodes)))) . collectAsMap()cur ^= 1 完 …
Dimension Reduction: PCA and SVD
def power_iteration (A, num_simulations): """ compute largest eigenvector and eigenvalue, code copy from …
pbds: STL 的扩展数据结构
cout<span style="color:#f92672"><<*</span>X.find_by_order(<span style="color:#ae81ff">1</span>)<span …