
简介
该用户还未填写简介
擅长的技术栈
未填写擅长的技术栈
可提供的服务
暂无可提供的服务
数据结构与算法 外部排序
1-1To merge 55 runs using 3 tapes for a 2-way merge, the original distribution (34, 21) is better than (30, 25).T1-2Replacement selection is a method for generating longer runs in external sorting.T1-
数据结构与算法 贪心法
1-2Let S be the set of activities in Activity Selection Problem. Then there must be some maximum-size subset of mutually compatible activities of S that includes the earliest finish activity a mT1-3令S
数据结构与算法 并查集
1-1In Union/Find algorithm, if Unions are done by size, the depth of any node must be no more than N/2, but not O(logN).FTime complexity ofNUnion and M Find operations isnow O( N + M log2 N ).Let T be
到底了