Fixed -universe successor problem Goal: maintain a dynamic subset s of size n of the universe 0=10, 1,.,u-1 of size u subject to these operations INSERT(X∈U\\S): Add x to s DELETE(X E S): Remove x from S

7.1局域网和广域网 7.2 Internet接入技术 7.3TCP/IP协议

10.1电子货币的概念和特征 10.2电子货币的分类 10.3电子交易模型 10.4网上银行

9.1网络安全的体系结构 9.2防火墙 9.3数据加密技术 9.4认证技术

Computational geometry Algorithms for solving geometric problems in 2D and higher Fundamental objects: o point line segment

Binary-search-tree sort 7∈ b Create an empty Bst for i=i to n do trEe-INSert(,AiD) Perform an inorder tree walk of t Example:

Quicksort Proposed by C. A.R. Hoare in 1962 Divide-and-conquer algorithm Sorts“ in place”( like insertion sort, but not like merge sort Very practical(with tuning)

Solving recurrences The analysis of merge sort from Lecture I required us to solve a recurrence Recurrences are like solving integrals erential equations, etc o Learn a few tricks Lecture 3: Applications of recurrences

复旦大学：《网络科学导论 Introduction to Network Science》学生课堂辩论陈述_反方-Love is all you need

01 Centrality 02 Friendship paradox 03 Math proof and Simulation 04 Analysis of Harvard experiment