修正希尔排序java实现的gap计算 #36
Merged
Conversation
This file contains hidden or 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
修正希尔排序java实现的gap计算
hustcc
reviewed
Aug 13, 2019
| @@ -99,7 +99,7 @@ public class ShellSort implements IArraySort { | |||
| int[] arr = Arrays.copyOf(sourceArray, sourceArray.length); | |||
|
|
|||
| int gap = 1; | |||
| while (gap < arr.length) { | |||
| while (gap < arr.length/3) { | |||
There was a problem hiding this comment.
代码规范一下。
while (gap < arr.length / 3) {运算符号和变量之间，加一个空格，让代码不那么紧凑！
There was a problem hiding this comment.
谢谢提醒,以后会注意.
Sorry, something went wrong.
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.
修正希尔排序java实现的gap计算