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

commit task_02 #198

Open
wants to merge 17 commits into
base: 2021
Choose a base branch
from
Open

commit task_02 #198

wants to merge 17 commits into from

Conversation

ll2525
Copy link

@ll2525 ll2525 commented Nov 27, 2021

No description provided.

Copy link
Member

@tagbug tagbug left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

算法还没仔细看,心得写的挺好的,文档结构也不错,注意一下代码高亮问题就更好了

@@ -0,0 +1,306 @@
### 1.bubble_sort(优化版):
```
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

使用```添加代码段时,可以在```后面加上对应的语言标识,比如```java,这样代码段会有高亮,方便阅读

2.在分析希尔排序的时间复杂度时,第一次分析时分析错误。再次认真分析后才分析对。
3.堆排序类似于插入排序与归并排序结合,拥有两者的优点。
4.计数排序与桶排序有些相似,但计数排序应用数据较密集时,而桶排序应该是应用于数据较分散时。
5.不是特别能理解基数排序的原理。
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

可以试试这个算法可视化网站 VisuAlgo - 排序 ,看看能不能帮助你理解

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

Successfully merging this pull request may close these issues.

2 participants