Homework9 各种排序算法 #176
Open
Homework9 各种排序算法 #176
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
chenfucaijun
requested changes
Jun 20, 2017
| int temp = l->data[i]; | ||
| l->data[i] = l->data[j]; | ||
| l->data[j] = temp; | ||
| (*move)++; |
| temp = l->data[j - gap]; | ||
| l->data[j - gap] = l->data[j]; | ||
| l->data[j] = temp; | ||
| } |
There was a problem hiding this comment.
- 希尔排序未做任何比较次数和移动次数的计算
| min = j; | ||
| } | ||
| } | ||
| if (min != i) |
There was a problem hiding this comment.
第i趟简单选择排序是指通过n−i次关键字的比较，从n−i+1个记录中选出关键字最小的记录，并与第i个记录进行交换
- 你这样写也能排序成功，但是已经脱离选择排序的初衷了
| printf("\nAfter Sort:\n"); | ||
| Print(&L); | ||
| printf("\ncompare time:%d\nmove time:%d\n", compare, move); | ||
| } |
There was a problem hiding this comment.
- 最后，这些排序算法完全可以写在一个程序文件中不同的方法。复用代码更值得去学习。
- 源程序文件名不要使用中文，注意细节！
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.