随笔分类 - Algorithms
摘要:Notes: This page records my naive machine learning notes. is learning feasible ? Hoeffding inequaility : link Hoeffding inequality formular's left sid
阅读全文
摘要:refer to this article 1 bool IsPrimeOptimizationThree(int number) 2 { 3 if(number<2) 4 return false; 5 if(number==2) 6 return ...
阅读全文
摘要:BFS is faster to find shortest path from root to leaf node of a tree. But the tradeoff is to use more memory.the basic trategy is to maintain a list t...
阅读全文

浙公网安备 33010602011771号