Vinn's Studio

Vinn's Studio

Goodbye. Halcyon days.

Docker
This is an encrypted article, please enter the password or contact me if you want to see the contents.
Trie Tree

字典树 (Trie Tree) 经常被用于搜索引擎系统。下面是一些最基本的介绍。

Gradient Descent
This is an encrypted article, please enter the password or contact me if you want to see the contents.
Time Complexity

算法复杂度是指算法在编写成可执行程序后,运行时所需要的资源,资源包括时间资源内存资源。复杂度也叫渐进复杂度,包括时间复杂度空间复杂度,用来粗略分析执行效率与数据规模之间的增长趋势关系,越高阶复杂度的算法,执行效率越低。复杂度分析是数据结构与算法的核心精髓,旨在不依赖硬件、宿主环境、数据集的情况下,粗略推导,考究出算法的效率和资源消耗情况。

Sort Algorithm

排序算法在很多领域得到相当重视,尤其是在大量数据的处理方面。一个优秀的算法可以节省大量的资源。此文整理了一些基本的排序算法以及相关拓展。

Binary Search

Binary search can reduce the time complexity to O(logN) for sorted items' search. I summarized a framework to slove all the binary search problems under different situation in this post.

Backtracking
This is an encrypted article, please enter the password or contact me if you want to see the contents.
avatar
Lingfeng Zhu
DataSci at UW Madison
FRIENDS
UW-Madison WHU