Algorithms: Coursera(Stanford)
文章平均质量分 85
lym1108csu
这个作者很懒,什么都没留下…
展开
-
Stanford - Algorithms: Design and Analysis, Part 1 - Week 4 Assignment: strongly connected component
本次作业要求如下:Question 1Download the text file here. Zipped version here. (Right click and save link as)The file contains the edges of a directed graph. Vertices are labeled as positive int原创 2015-03-03 07:05:28 · 2710 阅读 · 0 评论 -
Stanford - Algorithms: Design and Analysis, Part 1 - Week 3 Assignment: Contraction
本题的题目要求如下:Download the text file here. (Right click and save link as)The file contains the adjacency list representation of a simple undirected graph. There are 200 vertices labeled 1 to 200.原创 2015-02-22 11:29:09 · 1608 阅读 · 0 评论 -
Stanford - Algorithms: Design and Analysis, Part 1 - Week 2 Assignment: QuickSort
本次作业分三道题,但是基本都是差不多的,就是quicksort,题目要求如下:Question 1GENERAL DIRECTIONS:Download the text file here. The file contains all of the integers between 1 and 10,000 (inclusive, with no repeat原创 2015-02-09 11:35:26 · 3456 阅读 · 0 评论 -
Stanford - Algorithms: Design and Analysis, Part 1 - Week 5 Assignment: Dijkstra
本次作业要求如下:In this programming problem you'll code up Dijkstra's shortest-path algorithm. Download the text file here. (Right click and save link as). The file contains an adjacency list represe原创 2015-03-03 09:18:43 · 1434 阅读 · 0 评论 -
Stanford - Algorithms: Design and Analysis, Part 2 - Week 1 Assignment: Greedy and Prim
本次作业是正式引入greedy思想。。greedy中比较典型的算法包括之前讲过的Dijkstra,本节课讲的prim以及下节课要讲的Kruskal本次作业第一题和第二题基本是一个意思,一起讲:Question 1In this programming problem and the next you'll code up the greedy algorithms原创 2015-04-22 07:28:14 · 1958 阅读 · 0 评论 -
Stanford - Algorithms: Design and Analysis, Part 2 - Week 2 Assignment: Clustering
本周作业是有关Clustering的。。第一题如下:Question 1In this programming problem and the next you'll code up the clustering algorithm from lecture for computing a max-spacing k-clustering. Download the原创 2015-04-22 12:05:21 · 1932 阅读 · 2 评论 -
Stanford - Algorithms: Design and Analysis, Part 1 - Week 6 Assignment: hash table and heap
太久没有更新博客了,原来做的作业都没有写blog,现在印象已经有点模糊了,不过还是得贴出来,方便以后查阅。。本次作业算是比较简单的一次。。。。一共两道题,第一题题目要求如下:Question 1Download the text file here. (Right click and save link as).The goal of this proble原创 2015-04-16 06:54:19 · 2263 阅读 · 0 评论 -
Stanford - Algorithms: Design and Analysis, Part 1 - Week 1 Assignment: number of inversions
题目要求如下:Download the text file here. (Right click and save link as)This file contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated.Y原创 2015-01-25 11:32:21 · 1087 阅读 · 0 评论