categories

Tutorial

Deep Learning Tutorail Collection

less than 1 minute read

For beginners Focus on theory Dive Into Deep Learning by Mu Li Focus on practice Reproduce GPT-2 by Andrej karpathy with a 4-hours video on YouTu...

Back to top ↑

Algorithm

Quick-select k-th smallest elements in lists

1 minute read

快速选择算法基于两种partition算法(Lomuto,Hoare)实现,在两种不同的partition算法会产生完全不同的算法实现,深入了解不同的划分方式差异,对算法理解和实现有重要作用。 接下来将从pivot选择、机制、pivot最终位置、性能和稳定性上分析两者不同。

Back to top ↑