|
1 | 1 | # data_structure
|
2 |
| -> [English](./readme_en.md) [简体中文](./readme.md) |
| 2 | +> [English](./readme.md) [简体中文](./readme_zh.md) |
3 | 3 |
|
4 |
| -## 关于英文以及一些复杂数据结构的实现 |
| 4 | +## Why i writing in English ? |
| 5 | +As an chinese people, why i writing articles or codes in English. |
| 6 | +The primitive reason as following: |
| 7 | +1. English is the most commonly spoken language in the world. |
| 8 | +2. Improve my English skills in reading and writing. |
| 9 | +3. An medium to communicate with others. |
5 | 10 |
|
6 |
| -最近评估了工作量,发现英文文档以及一些复杂数据结构的实现不是几个月能够完成的事情。 |
7 |
| -因此决定按照以下方式进行: |
| 11 | +Unfortunately, I have an **poor English**, so **forgive me**. |
8 | 12 |
|
9 |
| -1. 先骨骼,再经络: 即先将数据结构的雏形搭建出来,后面在进行一遍测试加完善 |
10 |
| -2. 兼测试,兼英文: 因为第一遍,主要是概念的理解以及基础结构的搭建,因此英文文档和测试放到第二遍进行完善。 |
11 |
| -3. 坚守 PDCA 计划,争取打造出高质量的开源项目 |
12 |
| -4. 由于最近计划考研,所以一些完善估计要放到年末开始,在此之前以广而理解为主 |
| 13 | +**I will fix those articles irregularly until they are acceptable**. |
13 | 14 |
|
14 |
| -## `leetcode` 相关 |
15 |
| -> 在部分文档中,会涉及到 `leetcode` 的一些题目,它的一些实现请看 |
16 |
| -> [leetcode](https://github.com/hsjfans/leetcode) |
| 15 | +## Leetcode related |
| 16 | +Some sections may be contact with `leetcode` problems, the implements can be found in: |
| 17 | +- [leetcode](https://github.com/hsjfans/leetcode) |
| 18 | +- [online judge](https://github.com/online-judge/leetcode) |
17 | 19 |
|
18 |
| -本仓库包含了基础的数据结构以及算法,每一种数据结构以及算法都有自己对应的`md`文档,以及参考链接 |
19 | 20 |
|
20 |
| -注意: 此项目代码**未在生产环境使用过**,仅用于学习和交流。同时代码还未进行测试! |
| 21 | +This repository contains the fundamental data structures and algorithms. |
21 | 22 |
|
22 |
| -## 整体 |
| 23 | +Each of them has its own separated `README.MD`,implement and some simply instances of applications ; |
23 | 24 |
|
24 |
| - |
| 25 | +**Note that** ⚠️ this project is aimed at learning and researching purposes only, Using in production isn.t the purpose . |
25 | 26 |
|
26 |
| -## 数据结构 |
27 |
| -> 数据结构是计算机体系的基础骨骼部分,是相互之间存在一种或者多种特定关系的数据元素的集合,当然又包含了对应的一些函数或者方法 |
| 27 | + |
| 28 | +## Data Structures |
| 29 | +> The data structure is the basic skeleton of the computer system, which is a collection of elements that have one or more specific relationships with each other,contains some corresponding functions or methods also. |
28 | 30 |
|
29 | 31 | ### list
|
30 | 32 | - [x] [array_list](./docs/array_list.md)
|
|
40 | 42 |
|
41 | 43 | ### tree
|
42 | 44 | - [x] [tree](./docs/tree.md)
|
43 |
| -- [x] [binary_tree](./docs/binary_tree.md) |
44 |
| -- [x] [binary_search_tree](./docs/binary_search_tree.md) |
45 |
| -- [x] [avl_tree](./docs/avl_tree.md) |
46 |
| -- [x] [red_black_tree](./docs/red_black_tree.md) |
47 |
| -- [x] [b_tree](./docs/b_tree.md) |
48 |
| -- [x] [b_plus_tree](./docs/b_plus_tree.md) |
| 45 | +- [ ] [binary_tree](./docs/binary_tree.md) |
| 46 | +- [ ] [avl_tree](./docs/avl_tree.md) |
| 47 | +- [ ] [heap](./docs/heap.md) min and max heap |
| 48 | +- [ ] [red_black_tree](./docs/red_black_tree.md) |
| 49 | +- [ ] [b_tree](./docs/b_tree.md) |
49 | 50 | - [ ] [segment_tree](./docs/segment_tree.md)
|
50 | 51 | - [ ] [prefix_tree](./docs/prefix_tree.md)
|
51 | 52 | - [ ] and other ...
|
52 | 53 |
|
53 | 54 | ### map
|
54 |
| -- [x] [hash_table](./docs/hash_table.md) tree_map;hash_table |
55 |
| - |
56 |
| -### heap |
57 |
| -- [ ] [heap](./docs/heap.md) min and max heap |
| 55 | +- [ ] [hash_table](./docs/hash_table.md) tree_map;hash_table |
58 | 56 |
|
59 | 57 | ### set
|
60 | 58 | - [ ] [set](./docs/set.md) tree_set;...
|
|
63 | 61 |
|
64 | 62 | ### graph
|
65 | 63 | - [ ] [graph](./docs/graph.md)
|
66 |
| - |
67 |
| - |
68 |
| -## 算法 |
69 |
| - |
70 |
| -### sorting |
71 |
| - |
72 |
| -- [ ] [bubble_sort](./docs/bubble_sort.md) |
73 |
| -- [ ] [quick_sort](./docs/quick_sort.md) |
74 |
| - |
75 |
| - |
76 |
| - |
77 |
| -## Testing |
78 |
| - |
79 |
| -- [ ] [array_list](./test/array_list_test.c) |
80 |
| -- [ ] [linked_list](./test/linked_list_test.c) |
81 |
| -- [ ] [double_linked_list](./test/double_linked_list.c) |
82 |
| -- [ ] [queue](./test/queue.c) |
83 |
| -- [ ] [stack](./test/stack.c) |
84 |
| -- [ ] [skip_list](./test/skip_list.c) |
85 |
| -- [ ] and other ... |
86 |
| - |
87 |
| - |
88 |
| -## Reference |
89 |
| - |
90 |
| -本仓库的概念以及相关代码,大部分参考 <<算法导论>> 以及 <<数据结构与算法分析>>, |
91 |
| -还有一些参考 论文或者 博客等
9E81
code> |
0 commit comments