Algorithms(Part I)
文章平均质量分 59
zypandora
这个作者很懒,什么都没留下…
展开
-
Week1-3Quick Union
Data Structure Integer array id[] of size N Root of i isid[id[id[…id[i]…]]](keep going until it doesn’t change) Operations Find( p, q ): check if p and q have the same root Union( p, q ): to merge comp原创 2015-09-09 22:32:15 · 259 阅读 · 0 评论 -
Week1-11Memory
Basics原创 2015-09-13 12:16:20 · 262 阅读 · 0 评论 -
Week1-9Order-of-Growth classifications
Common Order-of-Growth classificationsSmall set of functions 1,logN,N,NlogN,N2,N3,abN1, logN, N, NlogN, N^2, N^3, ab^N linearithmic and linear scale with the input size!!Binary SearchImplementationpu原创 2015-09-13 11:31:50 · 455 阅读 · 0 评论 -
week1-7Observations
Example: 3-SUMGiven N distinct integers, how many triples sum to exactly zero?Brute Force AlgorithmMeasuring the running timeWe can calculate the real running time for various input sizes and make a pl原创 2015-09-12 17:32:40 · 257 阅读 · 1 评论 -
Week1-6Analysis of Algorithm Introduction
Running Time原创 2015-09-12 17:07:55 · 291 阅读 · 0 评论 -
week1-10Theory of algorithms
Type of analyses Best case: lower bound Worst case: upper bound Average case: expected cost for random input Actual data might not match input model? Need to understand the input to effectively process原创 2015-09-13 12:04:16 · 195 阅读 · 0 评论 -
Week1-8Mathematical Model
Mathematical model for running timeCost of basic operations And there are many many other ops that can be calculated.Example:1-SUM2-SUM Maybe we should just count the ones that are most expensive!!!原创 2015-09-13 00:03:39 · 264 阅读 · 0 评论 -
Week1-5Union-Find Applications
ApplicationsPercolationlikelihood of percolationDepends on the site vacancy probability p.Percolation phase transition No analytic solutions, only computer simulation answers!! Solution: Monte Carlo原创 2015-09-12 16:16:36 · 205 阅读 · 0 评论 -
Week1-4Qucik-Union Improvments
Improvement 1: weightingweighted quick union modify quick-union to avoid tall trees keep track of size of each tree(number of each objects) balance by linking root of smaller tree to the root of larger原创 2015-09-11 23:22:38 · 255 阅读 · 0 评论 -
Week1-2Quick Find
Quick Find(eager approach)Data Structure-Integer Array id[] of size N -Interpretation: p and q are connected iff they have the same idExample Findconnected( p, q ) Check if p and q have the same idUni原创 2015-09-05 17:05:09 · 219 阅读 · 0 评论 -
Week1-1Dynamic Connectivity
Given a set of N objects, main operations are:-Union Command: Connect 2 objects: union( a, b ) -Find/Connected query: is there a path connecting the 2 objects? connect ( a, b )Answer the question if t原创 2015-09-05 16:12:49 · 243 阅读 · 0 评论 -
Week0-1Course Overview
Focus-Algorithm -Data Structure The course is separated into 2 parts. Why study algorithm?-To solve problems that could not be otherwise addressed. -For intellectual stimulation. -To become a prof原创 2015-09-04 23:29:55 · 254 阅读 · 0 评论