Algorithm期末考试涉及 BFS DFS search, Linear programming, splay tree, min Cut, hash, Dynamic programming, network flow, Dijkstra’s algorithm 最短路径, NP completeness, Approximate algorithm 近似算法等, 范围非常广. 最终得分106/110, 差4分满分.
算法代考准满分
Algorithm期末考试涉及 BFS DFS search, Linear programming, splay tree, min Cut, hash, Dynamic programming, network flow, Dijkstra’s algorithm 最短路径, NP completeness, Approximate algorithm 近似算法等, 范围非常广. 最终得分106/110, 差4分满分.
