Commit graph

309 commits

Author SHA1 Message Date
RiverTwilight
7cd1347b44 code(js): worst best time complexity 2023-01-05 10:16:05 +08:00
Yudong Jin
51004b8a85
Apply suggestions from code review
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:05:59 +08:00
Yudong Jin
03aeda84e2
Update docs/chapter_computational_complexity/time_complexity.md
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:02:51 +08:00
Yudong Jin
3fa04aeb4a
Update docs/chapter_computational_complexity/time_complexity.md
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:02:19 +08:00
Yudong Jin
2acf85a626
Update docs/chapter_computational_complexity/time_complexity.md
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:02:09 +08:00
Yudong Jin
3906c3df06
Update docs/chapter_computational_complexity/time_complexity.md
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:01:53 +08:00
Yudong Jin
d5969e4070
Update docs/chapter_computational_complexity/time_complexity.md
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:01:42 +08:00
Yudong Jin
b5c9db935e
Update docs/chapter_computational_complexity/time_complexity.md
Co-authored-by: Justin Tse <xiefahit@gmail.com>
2023-01-05 01:00:56 +08:00
RiverTwilight
36e83352b8 lint: added missing comment 2023-01-03 11:17:11 +08:00
RiverTwilight
23b4aa118b code: added scripts to the doc 2023-01-02 22:07:48 +08:00
RiverTwilight
92c8d34f13 lint: remove extra indent 2023-01-02 21:53:21 +08:00
RiverTwilight
6e2412f897 lint: code lint 2023-01-02 20:40:01 +08:00
RiverTwilight
2bd24e61a8 code: added doc code 2023-01-02 18:57:26 +08:00
RiverTwilight
3f00aa39fb code: added code for time complexity chapter 2023-01-02 18:47:36 +08:00
René Wang
c94101a365
docs: added Typescript and Javascript examples
Not sure whether these formats meet the requirement. If everything is okay I will continue to transcribe more:-)
2023-01-01 19:29:45 +08:00
GN-Yu
af0ce1f344
Merge branch 'krahets:master' into patch-1 2022-12-30 13:19:21 -05:00
Zhizhen He
507f07ac4b
fix typo 2022-12-30 18:37:12 +08:00
Yudong Jin
0950e43fd7
Merge pull request #178 from guowei-gong/gongguowei
docs(array): sample code for golang
2022-12-30 16:46:18 +08:00
Yudong Jin
e5497496f9
Update array.md 2022-12-30 16:45:40 +08:00
Yudong Jin
f2f476a578
Merge pull request #191 from L-Super/patch-1
Add insertion sort in C
2022-12-30 16:37:53 +08:00
Yudong Jin
88dfc389b8
Merge pull request #192 from Wonderdch/patch-1
添加 C# 内置的双向队列示例
2022-12-30 16:12:07 +08:00
Yudong Jin
56b6bf10f8
Update deque.md 2022-12-30 16:11:47 +08:00
Yudong Jin
2465db1eff
Update space_complexity.md
Fix the Go code.
2022-12-30 15:57:15 +08:00
moonache
d8bf0b02d1
添加 C# 内置的双向队列示例
RT
2022-12-30 14:28:39 +08:00
L-Super
23bbaf12b9
Merge branch 'krahets:master' into patch-1 2022-12-30 09:30:51 +08:00
Listening
0dda12e0ab add insertion sort content 2022-12-30 09:26:26 +08:00
GN-Yu
4ca09c1015
Update merge_sort.md
修改了代码注释使其表述更严谨,如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
Yudong Jin
047e15e8d5
Merge pull request #183 from guowei-gong/binary_tree
docs(binary_tree): fix comment style and punctuation
2022-12-29 00:50:53 +08:00
Yudong Jin
78fa5e18c3
Merge pull request #184 from XC-Zero/patch-1
Update data_and_memory.md
2022-12-29 00:50:07 +08:00
Yudong Jin
78c2b94422
Update data_and_memory.md 2022-12-29 00:49:50 +08:00
Yudong Jin
b58cd21bed
Merge pull request #185 from guowei-gong/binary_search_tree
docs(binary_search_tree): variable name error
2022-12-29 00:48:49 +08:00
Daniel
bb95d47d8e
Merge branch 'krahets:master' into master 2022-12-28 21:56:30 +11:00
龚国玮
debcc984e1 docs(binary_search_tree): variable name error
Combining Context, Compare 'cur.val' and 'num', not 'cur.val' and 'val`.
2022-12-28 17:07:59 +08:00
XC-Zero
a4161b5fa2
Update data_and_memory.md
update tab to space
2022-12-28 14:27:28 +08:00
XC-Zero
af5497e70b
Update data_and_memory.md
add code for go
2022-12-28 14:11:36 +08:00
龚国玮
bd5cfb1117 docs(binary_tree): fix comment style and punctuation 2022-12-28 12:29:29 +08:00
龚国玮
f0c3bf5766 docs(array): reduce understanding cost
- 去除了并行测试;
- 基于 Java 代码样例,统一了命名风格;
- 基于 Go link 模块代码样例,统一了测试用例风格;
- 我们将 Go 中的 Slice 切片看作 Array 数组。因为这样可以降低理解成本,利于我们将关注点放在数据结构与算法上。
2022-12-28 10:46:12 +08:00
Yudong Jin
eeb0aec2f1
Merge pull request #166 from L-Super/patch-1
Update bubble_sort.md
2022-12-27 20:13:55 +08:00
Yudong Jin
34ad07bfed Fine tune 2022-12-27 20:11:22 +08:00
Yudong Jin
fd6e993f25
Merge pull request #175 from nuomi1/feature/time_complexity-Swift
feat: add Swift codes for time complexity article
2022-12-27 20:00:17 +08:00
Yudong Jin
466fdd494b Update the chapter tree. 2022-12-27 19:42:39 +08:00
Yudong Jin
d03980e185 Merge branch 'master' of github.com:krahets/hello-algo 2022-12-27 19:39:37 +08:00
Yudong Jin
f9cc3a50cf Fine tune 2022-12-27 19:38:14 +08:00
Yudong Jin
449258f0b0 Add the code to the docs. 2022-12-27 19:33:58 +08:00
Yudong Jin
c4d32621c3
Merge branch 'master' into master 2022-12-27 19:16:39 +08:00
a16su
8b401c2acb
fix format error 2022-12-27 18:34:12 +08:00
Yudong Jin
8e9bfabae2 Fix binary search tree. 2022-12-27 17:10:23 +08:00
danielsss
f79089d729
Fixed inconsistent brackets 2022-12-27 17:06:39 +11:00
danielsss
eaa48b6b9f
Fixed wrong parameter of Hash Map Set 2022-12-27 16:52:19 +11:00
Daniel
4e95997386
Merge branch 'krahets:master' into master 2022-12-27 16:50:54 +11:00