Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

2020年4月上旬 面试中的时间复杂度分析【分享+讨论】 #26

Open
yudidi opened this issue Apr 2, 2020 · 0 comments
Open

Comments

@yudidi
Copy link
Member

yudidi commented Apr 2, 2020

需要回答的问题

Q: 通常说的时间复杂度,是指最坏or平均时间复杂度?

Q: 快排的时间复杂度是多少?

参考

  1. 这个视频最后1分钟说,时间复杂度一般分析常见情况,对特殊情况心理有数就行
  2. 课件里先说o是算法执行的最低上界,之后又说它指的是平均情况。请问这两种说法是矛盾的吗?分析复杂度时应该按哪种说法来取?谢谢老师!
  3. 排序的复杂度默认是nlogn吗?
@yudidi yudidi added TODO and removed TODO labels Apr 2, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant