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

bfptr算法的Go实现 #8

Open
2 tasks
63isOK opened this issue Sep 7, 2020 · 1 comment
Open
2 tasks

bfptr算法的Go实现 #8

63isOK opened this issue Sep 7, 2020 · 1 comment

Comments

@63isOK
Copy link
Collaborator

63isOK commented Sep 7, 2020

  • 实现bfptr算法
  • 实现top-k问题
@63isOK
Copy link
Collaborator Author

63isOK commented Sep 9, 2020

之前实现是基于单个元素 存在局限性 例如不在乎比较的元素 而在意元素在容器中的位置 这样基于元素的实现就不好了

参考标准库的sort 来重新实现

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