From d8bb2881d8ea0f231f397f221223f3505b74943e Mon Sep 17 00:00:00 2001
From: chefyuan <tan45duyuan@163.com>
Date: Tue, 6 Apr 2021 20:00:16 +0800
Subject: [PATCH] chefyuan

---
 animation-simulation/数据结构和算法/希尔排序.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/animation-simulation/数据结构和算法/希尔排序.md b/animation-simulation/数据结构和算法/希尔排序.md
index 15ef401..884c9c6 100644
--- a/animation-simulation/数据结构和算法/希尔排序.md
+++ b/animation-simulation/数据结构和算法/希尔排序.md
@@ -39,7 +39,7 @@ class Solution {
             //根据增量分组
             for (int i = 0; i < increment; ++i) {
                 //这快是不是有点面熟，回去看看咱们的插入排序
-                for (int j = i + increment; j < nums.length; ++j) {
+                for (int j = i + increment; j < nums.length; j += increment) {
                     int temp = nums[j];
                     int k;
                     for (k = j - increment; k >= 0; k -= increment) {