krahets
d528b1ae07
Update index.md
2023-06-02 20:30:29 +08:00
liuyuxin
281c0c618a
feat: modify some Dart codes and add Dart code blocks to the docs ( #543 )
2023-06-02 14:56:29 +08:00
Yudong Jin
025051c81b
Add Dart codes to the documents. ( #529 )
2023-06-02 02:40:26 +08:00
Yudong Jin
041a989d33
Add the chapter cover images ( #528 )
2023-06-02 01:36:51 +08:00
krahets
033dca77fe
Update the summary of array and linkedlist
2023-06-02 01:29:48 +08:00
krahets
268c73b3c3
Update and fix some contents.
...
Place the comment box above the comments.
2023-06-01 18:46:07 +08:00
krahets
de10d2e471
Fix selection_sort.md
2023-06-01 00:34:41 +08:00
krahets
e35e2e31eb
Add the figure of assembling blocks.
...
Update some texts.
2023-05-31 01:04:40 +08:00
krahets
5cf10d6924
Update a gif preview.
2023-05-28 17:25:18 +08:00
krahets
9872e7f94f
Update the gif previews.
2023-05-28 16:55:41 +08:00
krahets
6f76203dd9
Fix some mistakes.
2023-05-27 17:13:51 +08:00
Sizhuo Long
1028c0c083
add Q&A about array_and_linklist and fix miss one "$" in c_c chapter ( #515 )
...
* fix "$" in c_c summary and add QA of array_linklist in summary
* Update summary.md
* Update summary.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-26 21:27:34 +08:00
krahets
fb72aa385e
Polish some texts.
2023-05-26 20:34:48 +08:00
Yudong Jin
ee716a2c23
feat: Add the section of heap sort. ( #516 )
...
* Add the section of heap sort.
* Update heap_sort.cpp
2023-05-26 04:46:56 +08:00
krahets
afb08a26e0
Fix a typo.
2023-05-26 04:31:14 +08:00
krahets
11c835d79c
Update the section of heap.
2023-05-25 20:25:19 +08:00
krahets
b9178bc7d6
Polish some texts.
2023-05-24 20:57:08 +08:00
Sizhuo Long
16365ae5f0
Add Q&A of computational_complexity and graph chapter ( #512 )
...
* add Q&A in the summary.md of computational complexity chapter
* add Q&A in the summary.md of graph
* Update summary.md
* Update summary.md
* Update summary.md
* Update summary.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-24 20:46:12 +08:00
krahets
dc49fdf75e
Polish some contents.
2023-05-24 11:45:52 +08:00
krahets
38c56b581a
Fix the figures of selection sort.
2023-05-24 00:44:55 +08:00
Yudong Jin
77b4f4c400
Add the section of selection sort. ( #513 )
2023-05-24 00:35:46 +08:00
krahets
5dff1bd0e8
Update the insertion sort.
2023-05-24 00:33:27 +08:00
krahets
588980af86
Update the sorting algorithms.
2023-05-24 00:05:12 +08:00
krahets
a2d2011c78
Update some figures in bubble sort
...
and insertion sort
2023-05-23 23:21:56 +08:00
krahets
eb8df49993
Update bubble sort and insertion sort.
2023-05-23 21:20:14 +08:00
krahets
5b406666d8
Polish the content
2023-05-22 22:04:31 +08:00
krahets
e196962d0a
Simplify the declarations of the Python code.
2023-05-22 22:03:57 +08:00
krahets
081b76d620
Polish the sections of binary search.
2023-05-22 01:37:12 +08:00
krahets
24d90931e3
Update the callouts for the algorithm problems.
2023-05-21 19:58:21 +08:00
krahets
d3cc149c5a
Merge the chapter of binary tree and searching.
2023-05-21 19:26:52 +08:00
Yudong Jin
b5eb9ca271
feat: Add the section of binary search edge. ( #508 )
...
* Add the section of binary search edge.
* Delete binary_search_rotation.py
2023-05-21 19:04:21 +08:00
krahets
c3e7455285
Refactor the section of bianry search.
2023-05-21 04:51:32 +08:00
krahets
399e5df39a
Polish some cotents.
2023-05-18 20:27:58 +08:00
Suremotoo
951599e192
Update hash_collision.md ( #504 )
...
* Update hash_collision.md
a detailed description of the conditions for converting a linked list into a red-black tree is as follows.
```java
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
}
```
* Update hash_collision.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-18 19:02:32 +08:00
krahets
00f8253353
Update the style of Q&A
2023-05-17 20:36:45 +08:00
krahets
e66fc03399
Add Q&A to the chapter of data structure.
...
Update the section of character encoding.
2023-05-17 20:33:45 +08:00
krahets
26cc480ff5
Fix some errors.
2023-05-17 05:13:41 +08:00
krahets
7cfe6d7efe
Add the section of number encoding
...
and character encoding
2023-05-17 04:38:32 +08:00
krahets
a60c7f148d
Update the summary of the chapter preface.
2023-05-16 21:52:49 +08:00
krahets
7ca27c3df1
Prepare 1.0.0b3 release.
2023-05-10 21:00:04 +08:00
krahets
def8da6617
Prepare 1.0.0b3 release
2023-05-10 19:47:30 +08:00
krahets
ef73b7b1f1
Update index.md
2023-05-09 00:55:42 +08:00
krahets
fe69f7240d
Add figures to replace_linear_by_hashing.md
2023-05-09 00:36:18 +08:00
Yudong Jin
67d647ab59
feat: Add the section of n queens problem ( #483 )
...
* Add the section of n queens problem
* Update n_queens.py
* Update n_queens.java
* Update n_queens.cpp
* Update n_queens.java
2023-05-04 05:27:17 +08:00
krahets
ca76336a55
Fix C code in quick_sort.md
2023-05-03 18:30:25 +08:00
krahets
9c070a028f
Update the code of permutations I and II
2023-04-27 01:29:00 +08:00
krahets
145975b335
Rename the common modules in Java, C++ and C.
2023-04-24 04:11:18 +08:00
Yudong Jin
c6eecfd0dc
feat: Add the section of permutations problem. ( #476 )
...
* Add the section of permutations problem.
* Update permutations_problem.md
2023-04-24 03:33:30 +08:00
krahets
bad759b4f8
Rename the naming of the coding files
...
in backtracking algorithm.
Add the typedef to docs.
2023-04-22 01:38:53 +08:00
krahets
2351fd1a1a
Add the animation for the tree preorder traversal
2023-04-18 23:10:37 +08:00