随笔分类 -  Algorithms of Coursera

Algortithms 在Coursera上的课程作业
摘要:题目原文: Given a set of n integers S = {0,1,…,N-1}and a sequence of requests of the following form: Remove x from S Find the successor of x: the smallest 阅读全文
posted @ 2017-07-19 10:55 evasean 阅读(1654) 评论(0) 推荐(0)
摘要:题目原文: Add a method find() to the union-find data type so that find(i) returns the largest element in the connected component containing i. The operati 阅读全文
posted @ 2017-07-19 10:52 evasean 阅读(642) 评论(0) 推荐(0)
摘要:题目原文描述: Given a social network containing. n members and a log file containing m timestamps at which times pairs of members formed friendships, design 阅读全文
posted @ 2017-07-19 10:49 evasean 阅读(1794) 评论(0) 推荐(0)
摘要:题目来源http://coursera.cs.princeton.edu/algs4/assignments/percolation.html 作业分为两部分:建立模型和仿真实验。 最关键的部分就是建立模型对象。模型对象要求如下: The model. We model a percolation 阅读全文
posted @ 2017-07-19 10:46 evasean 阅读(1367) 评论(3) 推荐(1)