And in that case, in general lists, I need to figure out what's the access time.
一些浮点数,一些字符串,一些数组内部的数组,各种各样。
Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.
这里的复杂度不再是对数的了,因为每次在列表中,查找需要线性访问,可能还要糟糕,其实,有些编程语言,如。
This is from a U.S. Government website called treasurydirect.gov and you can get on and access it at any time.
来自于美国政府网站,treasurydirect.gov,你们也可以随时访问
应用推荐