- 博客(3)
- 收藏
- 关注
RSS订阅原创 Algorithms,part1 week1
Interview Questions: Union-FindQuestion 1Social network connectivity. Given a social network containing N members and a log file containing M timestamps at which times pairs of members for
2012-08-22 11:09:15
1907
翻译 CS106B Lecture 15 sort
selection sortO(n^2) O(n^2) 1.完全随机： 更多元素比较((n^2)/2次);更少的元素移动次数(n次) 2.部分排序：更多移动和比较 insertion sort1.完全随机：比一次移动一次((n^2)/4次)2.部分排序：少量移动排序，因为可以识别有序性double input->>4X TIMEh
2012-08-05 15:38:48
297
翻译 CS106B Lecture 23 Graph
DS&A in javaP378Graph representation1. adjacency list which represents all vertices adjacent to each vertexusing linked list or star representation2.adjacency matrix3. incidence matrix
2012-08-05 14:56:39
680
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人