hello-algo

History

修改了代码注释使其表述更严谨，如C++中：

for (int k = left; k <= right; k++) {
            // 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++
            if (i > leftEnd)
                nums[k] = tmp[j++];
            // 否则，若“右子数组已全部合并完”或“左子数组元素 <ins> <= </ins> 右子数组元素”，则选取左子数组元素，并且 i++
            else if (j > rightEnd || tmp[i] <= tmp[j])
                nums[k] = tmp[i++];
            // 否则，若<ins>“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”</ins>，则选取右子数组元素，并且 j++
            else
                nums[k] = tmp[j++];
        }

2022-12-29 17:50:02 -05:00

assets/images

Add about me. Update contribution, suggestions,

2022-11-24 19:32:32 +08:00

chapter_array_and_linkedlist

Update C# code.

2022-12-24 17:05:58 +08:00

chapter_computational_complexity

Merge pull request #175 from nuomi1/feature/time_complexity-Swift

2022-12-27 20:00:17 +08:00

chapter_data_structure

Update data_and_memory.md