mit 计算机科学及编程导论（8）

words:

canonical , cube , squint , crucial , consequence , asymptotic , characterize , quadratic , collapse , gee , recurrence , eyeball , funky , sweat , tentative , encrusted , wince , label , applause , blink , spicy , facetious , crunch , gamble , plug , flip , hypothesis

notes:

1.  different kinds of complexity with primitive steps : linear  ,  log  ,  quadratic , exponential

2.  how data structures interact with the analysis of the complexity :  if the time to access the data structure is constant ,then you can treat it as primitive steps

ps: 之前一直以为算时间复杂度就是算代码中有几次运算即可，没想到还要考虑到数据结构的访问时间。但是确实应该考虑到