Commit Graph

807 Commits

Author SHA1 Message Date
Justin Tse 2532f06c7f Add JavaScript and TypeScript code of heap sort, selection sort and binary search edge and Fix the indentation of TS code (#545)
* Fix the indentation of TS code

* Add JavaScript and TypeScript code of heap sort, selection sort and binary search edge

* Fix the style of JS and TS code
2023-06-05 00:20:11 +08:00
krahets 6377e3316a Fix a comment in my_list.xx 2023-06-03 22:18:28 +08:00
liuyuxin d0b1bf9b1a Update two_sum.dart (#544) 2023-06-02 20:23:27 +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
liuyuxin 53e18bc6d6 feat: complete dart code for chapter_searching and chapter_sorting (#526) 2023-06-02 02:52:10 +08:00
gonglja 86209e0a7b feat: Add C codes for bucket sort, heap sort, selection sort, binary search edge (#525)
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-06-02 02:51:35 +08:00
Yudong Jin 025051c81b Add Dart codes to the documents. (#529) 2023-06-02 02:40:26 +08:00
hpstory 671fbc84ee feat(csharp): add binary_search_edge, heap_sort, selection_sort (#527) 2023-06-01 18:52:18 +08:00
krahets e35e2e31eb Add the figure of assembling blocks.
Update some texts.
2023-05-31 01:04:40 +08:00
liuyuxin 8247a611d7 Update Dart code to output same as Java (#522) 2023-05-30 13:00:16 +08:00
Reanon 5bbcb12979 feat(sort/search): support heap/selection_sort/binary_search_edge in go code (#521)
* feat(go): support binary search edge and testcase

* feat(go): support selection sort and testcase

* feat(go): support heap sort and testcase

* Update selection_sort_test.go

* Update selection_sort.go

* Update heap_sort.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-29 12:23:52 +08:00
nuomi1 56a4385202 feat: add Swift codes for heap_sort article (#520) 2023-05-29 12:20:32 +08:00
nuomi1 8bed60f0d7 feat: add Swift codes for selection_sort article (#519) 2023-05-28 17:51:35 +08:00
nuomi1 4ce20f6bbc feat: add Swift codes for binary_search_edge article (#518) 2023-05-28 17:26:09 +08:00
krahets 6f76203dd9 Fix some mistakes. 2023-05-27 17:13:51 +08:00
krahets fb72aa385e Polish some texts. 2023-05-26 20:34:48 +08:00
krahets b39e79be85 Fix remove() in binary search tree. 2023-05-26 20:34:22 +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 11c835d79c Update the section of heap. 2023-05-25 20:25:19 +08:00
krahets dc49fdf75e Polish some contents. 2023-05-24 11:45:52 +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 eb8df49993 Update bubble sort and insertion sort. 2023-05-23 21:20:14 +08:00
xBLACKICEx abecea9ab6 feat(rust/tree): add binary_search_tree (#481)
*  feat(rust/tree): add binary_tree_dfs

*  feat(rust/tree): add binary_tree_bfs

* 🐞 fix(rust/tree): can't list to any kind of tree

* feat(rust/tree): add binary_search_tree

* Update binary_search_tree.rs

* 🐞 fix(rust/tree): corret writing mistakes

* 🦄 refactor(rust/tree): remove get_next_node() function

* Update binary_search_tree.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-23 15:42:08 +08:00
krahets 89a9741e9e Fix some comments. 2023-05-22 23:13:54 +08:00
krahets f6d290d903 Update the comments of bubble sort
and insertion sort
2023-05-22 23:05:37 +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 24d90931e3 Update the callouts for the algorithm problems. 2023-05-21 19:58:21 +08:00
krahets d95c628eef Fix the test case of binary search. 2023-05-21 19:29:24 +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
Jefferson Huang 921d87c238 feat: add chapter_binary_search by dart (#506)
* feat: add chapter_sorting by dart

* feat: add chapter_searching by dart

* feat: add chapter_binary_search by dart

---------

Co-authored-by: huangjianqing <huangjianqing@52tt.com>
2023-05-21 02:31:15 +08:00
krahets 399e5df39a Polish some cotents. 2023-05-18 20:27:58 +08:00
Jefferson Huang 335bc29af2 feat: add chapter_sorting and chapter_searching by dart (#497)
* feat: add chapter_sorting by dart

* feat: add chapter_searching by dart

---------

Co-authored-by: huangjianqing <huangjianqing@52tt.com>
2023-05-18 19:05:48 +08:00
liuyuxin ec4202031e feat: add dart code for chapter_graph (#498) 2023-05-18 19:04:39 +08:00
krahets 817b4598d5 Fix a comment in binary_search_tree code 2023-05-17 19:04:46 +08:00
krahets b093162208 Fix my_list.py 2023-05-17 04:46:55 +08:00
krahets f35020b335 Fix bucket_sort. 2023-05-15 19:54:07 +08:00
ZeYanLin bae8298c8a fix:range issue (#496) 2023-05-15 14:57:08 +08:00
Reanon a6b3f72826 feat(go/backtracking): add go code (#488)
* feat(go/backtracking): add go code

* feat(backtracking): add n_queens in go

* feat(backtracking): add /preorder_traversal_i_compact in go

* feat(backtracking): add /preorder_traversal_ii_compact in go

* feat(backtracking): add /preorder_traversal_ii_template in go

* feat(backtracking): add preorder_traversal_iii_compact in go

* feat(backtracking): add preorder_traversal_test in go

* feat(backtracking): add permutations_i in go

* feat(backtracking): add permutations_ii in go

* feat(backtracking): add permutation_test in go

* feat(backtracking): fix bug in go

* Update permutations_i.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-15 01:17:42 +08:00
nuomi1 170713c642 feat: add Swift codes for n_queens_problem article (#495)
* refactor: rename PreorderTraversalIIITemplate

* feat: add Swift codes for n_queens_problem article
2023-05-15 01:13:17 +08:00
krahets 649d8c4c86 Fix the indentation of JS and TS code. 2023-05-14 01:40:19 +08:00
liuyuxin 541f384e7c Fix function call error and null safety (#491) 2023-05-14 01:19:06 +08:00
Justin Tse b52a98f178 Add JavaScript and TypeScript code of permutations and n_queens (Chapter of Backtracking) (#494)
* Add JavaScript and TypeScript code of permutations and n_queens (Chapter of Backtracking)

* Update n_queens.js

* Update permutations_i.js

* Update permutations_ii.js

* Update n_queens.ts

* Update permutations_i.ts

* Update permutations_ii.ts

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-14 01:18:40 +08:00
Justin Tse 01345c23ca Add JavaScript and TypeScript code of preorder traversal (Chapter of Backtracking) (#490)
* Add JavaScript and TypeScript code of preorder traversal (Chapter of Backtracking)

* Update preorder_traversal_iii_compact.ts
2023-05-11 23:46:12 +08:00
krahets fe69f7240d Add figures to replace_linear_by_hashing.md 2023-05-09 00:36:18 +08:00
gonglja 53ca2144e2 Fix the problem in binary_tree_bfs.c and the problem that the memory is not released. (#487)
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-09 00:01:23 +08:00
hpstory 40319e7f30 refactor: use global using to reduce usings in each file (#486) 2023-05-06 22:48:02 +08:00