1b1af8d038
Add Java and C++ code for the section hash algorithm ( #560 )
1 year ago
0e2ddba30f
Add the section of subset sum problem. ( #558 )
1 year ago
fd8b9ce853
Update README and the landing page.
1 year ago
c070d9f933
Update the landing page and README.
...
Add a example to algorithms_are_everywhere.md.
1 year ago
b6b03ef84b
Fix the figures of binary tree.
...
Replace null with None.
1 year ago
73372ad35a
Update the summary of hashing chapter.
1 year ago
29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. ( #555 )
1 year ago
4dddbd1e67
Polish the section of hash map and hash collision.
1 year ago
5a2a03416f
Update the section of hash collision.
1 year ago
9563965a20
Add the codes of hashmap ( #553 )
...
of chaining and open addressing
1 year ago
6c372542ae
Add new label.
1 year ago
a111b94f23
feat: Add the section of Top-K problem ( #551 )
...
* Add the section of Top-K problem
* Update my_heap.py
* Update build_heap.md
* Update my_heap.py
1 year ago
9de5d0bff2
add Q&A of stack_and_queue chapter ( #547 )
...
* add`Q&A` of `stack_and_queue` chapter
* Update summary.md
* Update summary.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
f7a2670756
Fix inline code with number_encoding.md ( #550 )
1 year ago
698c2e7fe5
Fix some codes and a figure.
1 year ago
d528b1ae07
Update index.md
1 year ago
281c0c618a
feat: modify some Dart codes and add Dart code blocks to the docs ( #543 )
1 year ago
025051c81b
Add Dart codes to the documents. ( #529 )
1 year ago
041a989d33
Add the chapter cover images ( #528 )
1 year ago
033dca77fe
Update the summary of array and linkedlist
1 year ago
268c73b3c3
Update and fix some contents.
...
Place the comment box above the comments.
1 year ago
de10d2e471
Fix selection_sort.md
1 year ago
e35e2e31eb
Add the figure of assembling blocks.
...
Update some texts.
1 year ago
5cf10d6924
Update a gif preview.
1 year ago
9872e7f94f
Update the gif previews.
1 year ago
6f76203dd9
Fix some mistakes.
1 year ago
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>
2 years ago
fb72aa385e
Polish some texts.
2 years ago
ee716a2c23
feat: Add the section of heap sort. ( #516 )
...
* Add the section of heap sort.
* Update heap_sort.cpp
2 years ago
afb08a26e0
Fix a typo.
2 years ago
11c835d79c
Update the section of heap.
2 years ago
b9178bc7d6
Polish some texts.
2 years ago
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>
2 years ago
dc49fdf75e
Polish some contents.
2 years ago
38c56b581a
Fix the figures of selection sort.
2 years ago
77b4f4c400
Add the section of selection sort. ( #513 )
2 years ago
5dff1bd0e8
Update the insertion sort.
2 years ago
588980af86
Update the sorting algorithms.
2 years ago
a2d2011c78
Update some figures in bubble sort
...
and insertion sort
2 years ago
eb8df49993
Update bubble sort and insertion sort.
2 years ago
5b406666d8
Polish the content
2 years ago
e196962d0a
Simplify the declarations of the Python code.
2 years ago
081b76d620
Polish the sections of binary search.
2 years ago
24d90931e3
Update the callouts for the algorithm problems.
2 years ago
d3cc149c5a
Merge the chapter of binary tree and searching.
2 years ago
b5eb9ca271
feat: Add the section of binary search edge. ( #508 )
...
* Add the section of binary search edge.
* Delete binary_search_rotation.py
2 years ago
c3e7455285
Refactor the section of bianry search.
2 years ago
399e5df39a
Polish some cotents.
2 years ago
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>
2 years ago
00f8253353
Update the style of Q&A
2 years ago
Yudong Jin
Sizhuo Long
Curly Brackets
liuyuxin
Suremotoo