第七次作业广度优先遍历最短路径 #143
Open
第七次作业广度优先遍历最短路径 #143
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
c4pr1c3
reviewed
May 17, 2017
| OVERFLOW | ||
| }Status; | ||
|
|
||
| Status CreateGraph(Graph *G) { |
There was a problem hiding this comment.
虽然就题论题你这里这样写是能得到正确答案的，但建议以后在实际应用编程时，尽量把这种参数配置类的工作交给调用者（函数）在调用函数时执行传参操作，代码的封装和可复用就会一点点积累起来了。
| return OK; | ||
| } | ||
|
|
||
| typedef enum { |
There was a problem hiding this comment.
所有代码都堆在一个文件里已经比较拥挤了，建议把所有的数据结构定义都前置在源代码文件的最开始处，起码不会像现在这样有点凌乱。
2017-1/zjc/第七次作业/main.c
Outdated
| return -1; | ||
| } | ||
| /*----------------���еIJ���------------*/ | ||
| #define FALSE 0 |
There was a problem hiding this comment.
前面刚刚定义过bool型枚举变量，这里没必要再来用宏重复造轮子了。
chenfucaijun
requested changes
Jun 4, 2017
| for (i = 0; i < 5; i ++ ) | ||
| { | ||
| if (SearchBST(T, b[i])) { | ||
| printf("在数中找到 %d ! 现在把这个数从树中删除。\n", b[i]); |
There was a problem hiding this comment.
- 请看作业要求： 在本次PR中，应包含采用纯文本文件的方式保存的查找表使用上述测试用例产生的程序输出结果。
chenfucaijun
requested changes
Jun 20, 2017
| j--; | ||
| move++; | ||
| } | ||
| R[j + 1] = temp; |
There was a problem hiding this comment.
- 这里是不是丢掉了1次移动次数的计算？下面的希尔排序也存在该问题
| temp = R[j]; | ||
| R[j] = R[j - 1]; | ||
| R[j - 1] = temp; | ||
| move++; |
There was a problem hiding this comment.
每一趟冒泡排序需进行i次比较，3i次移动
- 所以你的这里是不是应修改为
move+=3
| R[i] = R[k]; | ||
| R[k] = temp; | ||
| move++; | ||
| } |
There was a problem hiding this comment.
第i趟简单选择排序是指通过n−i次关键字的比较，从n−i+1个记录中选出关键字最小的记录，并与第i个记录进行交换
- 你这样写也能排序出来，但是已经脱离选择排序的初衷了
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.