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

新增冒泡排序的c++实现 #551

Merged
merged 7 commits into from
Sep 3, 2021
Merged

新增冒泡排序的c++实现 #551

merged 7 commits into from
Sep 3, 2021

Conversation

rongliang666
Copy link
Contributor

新增冒泡排序的c++实现

@yanglbme
Copy link
Member

yanglbme commented Sep 3, 2021

你好,代码没有格式化哈,并且也是原始版冒泡排序,可以改成优化版的

{
if(vec[j]>vec[j+1])
{
int tmp = vec[j];
Copy link
Member

Choose a reason for hiding this comment

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

对于交换操作,C++ 应该可以直接写成 swap(vec[j], vec[j+1]); 吧

//改进版本
void bubblesort1(vector<int>& vec)
{
for(int i=0;i<vec.size()-1;i++)
Copy link
Member

Choose a reason for hiding this comment

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

这里很多代码都没进行格式化呢,比如改成 for(int i = 0; i < vec.size() - 1; i++)

@yanglbme yanglbme merged commit eb5d484 into doocs:main Sep 3, 2021
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