8000 修正希尔排序java实现的gap计算 by hoop208 · Pull Request #36 · hustcc/JS-Sorting-Algorithm · GitHub
[go: up one dir, main page]
Skip to content

修正希尔排序java实现的gap计算 #36

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and t 8000 he community.

Sign up for GitHub

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

Merged
merged 1 commit into from
Aug 13, 2019
Merged

修正希尔排序java实现的gap计算 #36

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion 4.shellSort.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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) {
Copy link
Owner

Choose a reason for hiding this comment

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

代码规范一下。

while (gap < arr.length / 3) {

运算符号和变量之间，加一个空格，让代码不那么紧凑！

Copy link
Owner

Choose a reason for hiding this comment

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

算了，好像其他代码都存在这个问题!

Copy link
Contributor Author

Choose a reason for hiding this comment

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

谢谢提醒,以后会注意.

gap = gap * 3 + 1;
}

Expand Down
0