├── .gitee
├── ISSUE_TEMPLATE.zh-CN.md
└── PULL_REQUEST_TEMPLATE.zh-CN.md
├── .gitignore
├── .travis.yml
├── LICENSE
├── README.md
├── bubble_sort
├── README.md
├── pom.xml
└── src
│ └── main
│ └── java
│ └── me
│ └── zbl
│ └── bubblesort
│ ├── App.java
│ └── BubbleSort.java
├── heap_sort
├── README.md
├── pom.xml
└── src
│ └── main
│ └── java
│ └── me
│ └── zbl
│ └── heapsort
│ ├── App.java
│ └── HeapSort.java
├── merge_sort
├── pom.xml
└── src
│ └── main
│ └── java
│ └── me
│ └── zbl
│ └── mergesort
│ ├── App.java
│ └── MergeSort.java
├── pom.xml
├── quick_sort
├── README.md
├── pom.xml
└── src
│ └── main
│ └── java
│ └── me
│ └── zbl
│ └── quicksort
│ ├── App.java
│ └── QuickSort.java
├── shells_sort
├── README.md
├── pom.xml
└── src
│ └── main
│ └── java
│ └── me
│ └── zbl
│ └── shellssort
│ ├── App.java
│ └── ShellsSort.java
├── simple_choice_sort
├── README.md
├── pom.xml
└── src
│ └── main
│ └── java
│ └── me
│ └── zbl
│ └── simplechoice
│ ├── App.java
│ └── SimpleChoiceSort.java
└── straight_insertion_sort
├── README.md
├── pom.xml
└── src
└── main
└── java
└── me
└── zbl
└── straightinsert
├── App.java
└── StraightInserSort.java
/.gitee/ISSUE_TEMPLATE.zh-CN.md:
--------------------------------------------------------------------------------
1 | ### 该问题是怎么引起的?
2 |
3 |
4 |
5 | ### 重现步骤
6 |
7 |
8 |
9 | ### 报错信息
10 |
11 |
12 |
13 |
14 |
--------------------------------------------------------------------------------
/.gitee/PULL_REQUEST_TEMPLATE.zh-CN.md:
--------------------------------------------------------------------------------
1 | ### 该Pull Request关联的Issue
2 |
3 |
4 | ### 修改描述
5 |
6 |
7 |
8 | ### 测试用例
9 |
10 |
11 |
12 | ### 修复效果的截屏
13 |
14 |
15 |
16 |
--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
1 | # Compiled class file
2 | *.class
3 |
4 | # Log file
5 | *.log
6 |
7 | # BlueJ files
8 | *.ctxt
9 |
10 | # Mobile Tools for Java (J2ME)
11 | .mtj.tmp/
12 |
13 | # Package Files #
14 | *.jar
15 | *.war
16 | *.ear
17 | *.zip
18 | *.tar.gz
19 | *.rar
20 |
21 | # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
22 | hs_err_pid*
23 | .idea
24 | *.iml
--------------------------------------------------------------------------------
/.travis.yml:
--------------------------------------------------------------------------------
1 | language: java
2 | jdk:
3 | - oraclejdk8
4 | notifications:
5 | email: true
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | Apache License
2 | Version 2.0, January 2004
3 | http://www.apache.org/licenses/
4 |
5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6 |
7 | 1. Definitions.
8 |
9 | "License" shall mean the terms and conditions for use, reproduction, and
10 | distribution as defined by Sections 1 through 9 of this document.
11 |
12 | "Licensor" shall mean the copyright owner or entity authorized by the copyright
13 | owner that is granting the License.
14 |
15 | "Legal Entity" shall mean the union of the acting entity and all other entities
16 | that control, are controlled by, or are under common control with that entity.
17 | For the purposes of this definition, "control" means (i) the power, direct or
18 | indirect, to cause the direction or management of such entity, whether by
19 | contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the
20 | outstanding shares, or (iii) beneficial ownership of such entity.
21 |
22 | "You" (or "Your") shall mean an individual or Legal Entity exercising
23 | permissions granted by this License.
24 |
25 | "Source" form shall mean the preferred form for making modifications, including
26 | but not limited to software source code, documentation source, and configuration
27 | files.
28 |
29 | "Object" form shall mean any form resulting from mechanical transformation or
30 | translation of a Source form, including but not limited to compiled object code,
31 | generated documentation, and conversions to other media types.
32 |
33 | "Work" shall mean the work of authorship, whether in Source or Object form, made
34 | available under the License, as indicated by a copyright notice that is included
35 | in or attached to the work (an example is provided in the Appendix below).
36 |
37 | "Derivative Works" shall mean any work, whether in Source or Object form, that
38 | is based on (or derived from) the Work and for which the editorial revisions,
39 | annotations, elaborations, or other modifications represent, as a whole, an
40 | original work of authorship. For the purposes of this License, Derivative Works
41 | shall not include works that remain separable from, or merely link (or bind by
42 | name) to the interfaces of, the Work and Derivative Works thereof.
43 |
44 | "Contribution" shall mean any work of authorship, including the original version
45 | of the Work and any modifications or additions to that Work or Derivative Works
46 | thereof, that is intentionally submitted to Licensor for inclusion in the Work
47 | by the copyright owner or by an individual or Legal Entity authorized to submit
48 | on behalf of the copyright owner. For the purposes of this definition,
49 | "submitted" means any form of electronic, verbal, or written communication sent
50 | to the Licensor or its representatives, including but not limited to
51 | communication on electronic mailing lists, source code control systems, and
52 | issue tracking systems that are managed by, or on behalf of, the Licensor for
53 | the purpose of discussing and improving the Work, but excluding communication
54 | that is conspicuously marked or otherwise designated in writing by the copyright
55 | owner as "Not a Contribution."
56 |
57 | "Contributor" shall mean Licensor and any individual or Legal Entity on behalf
58 | of whom a Contribution has been received by Licensor and subsequently
59 | incorporated within the Work.
60 |
61 | 2. Grant of Copyright License.
62 |
63 | Subject to the terms and conditions of this License, each Contributor hereby
64 | grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
65 | irrevocable copyright license to reproduce, prepare Derivative Works of,
66 | publicly display, publicly perform, sublicense, and distribute the Work and such
67 | Derivative Works in Source or Object form.
68 |
69 | 3. Grant of Patent License.
70 |
71 | Subject to the terms and conditions of this License, each Contributor hereby
72 | grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
73 | irrevocable (except as stated in this section) patent license to make, have
74 | made, use, offer to sell, sell, import, and otherwise transfer the Work, where
75 | such license applies only to those patent claims licensable by such Contributor
76 | that are necessarily infringed by their Contribution(s) alone or by combination
77 | of their Contribution(s) with the Work to which such Contribution(s) was
78 | submitted. If You institute patent litigation against any entity (including a
79 | cross-claim or counterclaim in a lawsuit) alleging that the Work or a
80 | Contribution incorporated within the Work constitutes direct or contributory
81 | patent infringement, then any patent licenses granted to You under this License
82 | for that Work shall terminate as of the date such litigation is filed.
83 |
84 | 4. Redistribution.
85 |
86 | You may reproduce and distribute copies of the Work or Derivative Works thereof
87 | in any medium, with or without modifications, and in Source or Object form,
88 | provided that You meet the following conditions:
89 |
90 | You must give any other recipients of the Work or Derivative Works a copy of
91 | this License; and
92 | You must cause any modified files to carry prominent notices stating that You
93 | changed the files; and
94 | You must retain, in the Source form of any Derivative Works that You distribute,
95 | all copyright, patent, trademark, and attribution notices from the Source form
96 | of the Work, excluding those notices that do not pertain to any part of the
97 | Derivative Works; and
98 | If the Work includes a "NOTICE" text file as part of its distribution, then any
99 | Derivative Works that You distribute must include a readable copy of the
100 | attribution notices contained within such NOTICE file, excluding those notices
101 | that do not pertain to any part of the Derivative Works, in at least one of the
102 | following places: within a NOTICE text file distributed as part of the
103 | Derivative Works; within the Source form or documentation, if provided along
104 | with the Derivative Works; or, within a display generated by the Derivative
105 | Works, if and wherever such third-party notices normally appear. The contents of
106 | the NOTICE file are for informational purposes only and do not modify the
107 | License. You may add Your own attribution notices within Derivative Works that
108 | You distribute, alongside or as an addendum to the NOTICE text from the Work,
109 | provided that such additional attribution notices cannot be construed as
110 | modifying the License.
111 | You may add Your own copyright statement to Your modifications and may provide
112 | additional or different license terms and conditions for use, reproduction, or
113 | distribution of Your modifications, or for any such Derivative Works as a whole,
114 | provided Your use, reproduction, and distribution of the Work otherwise complies
115 | with the conditions stated in this License.
116 |
117 | 5. Submission of Contributions.
118 |
119 | Unless You explicitly state otherwise, any Contribution intentionally submitted
120 | for inclusion in the Work by You to the Licensor shall be under the terms and
121 | conditions of this License, without any additional terms or conditions.
122 | Notwithstanding the above, nothing herein shall supersede or modify the terms of
123 | any separate license agreement you may have executed with Licensor regarding
124 | such Contributions.
125 |
126 | 6. Trademarks.
127 |
128 | This License does not grant permission to use the trade names, trademarks,
129 | service marks, or product names of the Licensor, except as required for
130 | reasonable and customary use in describing the origin of the Work and
131 | reproducing the content of the NOTICE file.
132 |
133 | 7. Disclaimer of Warranty.
134 |
135 | Unless required by applicable law or agreed to in writing, Licensor provides the
136 | Work (and each Contributor provides its Contributions) on an "AS IS" BASIS,
137 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,
138 | including, without limitation, any warranties or conditions of TITLE,
139 | NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are
140 | solely responsible for determining the appropriateness of using or
141 | redistributing the Work and assume any risks associated with Your exercise of
142 | permissions under this License.
143 |
144 | 8. Limitation of Liability.
145 |
146 | In no event and under no legal theory, whether in tort (including negligence),
147 | contract, or otherwise, unless required by applicable law (such as deliberate
148 | and grossly negligent acts) or agreed to in writing, shall any Contributor be
149 | liable to You for damages, including any direct, indirect, special, incidental,
150 | or consequential damages of any character arising as a result of this License or
151 | out of the use or inability to use the Work (including but not limited to
152 | damages for loss of goodwill, work stoppage, computer failure or malfunction, or
153 | any and all other commercial damages or losses), even if such Contributor has
154 | been advised of the possibility of such damages.
155 |
156 | 9. Accepting Warranty or Additional Liability.
157 |
158 | While redistributing the Work or Derivative Works thereof, You may choose to
159 | offer, and charge a fee for, acceptance of support, warranty, indemnity, or
160 | other liability obligations and/or rights consistent with this License. However,
161 | in accepting such obligations, You may act only on Your own behalf and on Your
162 | sole responsibility, not on behalf of any other Contributor, and only if You
163 | agree to indemnify, defend, and hold each Contributor harmless for any liability
164 | incurred by, or claims asserted against, such Contributor by reason of your
165 | accepting any such warranty or additional liability.
166 |
167 | END OF TERMS AND CONDITIONS
168 |
169 | APPENDIX: How to apply the Apache License to your work
170 |
171 | To apply the Apache License to your work, attach the following boilerplate
172 | notice, with the fields enclosed by brackets "{}" replaced with your own
173 | identifying information. (Don't include the brackets!) The text should be
174 | enclosed in the appropriate comment syntax for the file format. We also
175 | recommend that a file or class name and description of purpose be included on
176 | the same "printed page" as the copyright notice for easier identification within
177 | third-party archives.
178 |
179 | Copyright 2018 James
180 |
181 | Licensed under the Apache License, Version 2.0 (the "License");
182 | you may not use this file except in compliance with the License.
183 | You may obtain a copy of the License at
184 |
185 | http://www.apache.org/licenses/LICENSE-2.0
186 |
187 | Unless required by applicable law or agreed to in writing, software
188 | distributed under the License is distributed on an "AS IS" BASIS,
189 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
190 | See the License for the specific language governing permissions and
191 | limitations under the License.
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # algorithm
2 |
3 | [](./LICENSE)
4 | [](https://www.travis-ci.org/JamesZBL/algorithm)
5 |
6 | 常见算法,如查找、排序等
--------------------------------------------------------------------------------
/bubble_sort/README.md:
--------------------------------------------------------------------------------
1 | # 冒泡排序 ( Bubble Sort )
--------------------------------------------------------------------------------
/bubble_sort/pom.xml:
--------------------------------------------------------------------------------
1 |
2 |
17 |
22 | * 先将数组构造成大顶堆 23 | * a.取出当前大顶堆的根节点,将其与序列末尾元素进行交换;此时:序列末尾的元素为已排序的最大值;由于交换了元素, 24 | * 当前位于根节点的堆并不一定满足大顶堆的性质 25 | * b.对交换后的 n-1 个序列元素进行调整,使其满足大顶堆的性质 26 | * 循环 a、b,直到堆中只剩下 1 个元素 27 | *
28 | * 一般的,升序排列用大顶堆,降序排列用小顶堆
29 | *
30 | * @author JamesZBL
31 | * @date 2018-02-26
32 | */
33 | public class HeapSort {
34 |
35 | /**
36 | * 排序
37 | *
38 | * @param raw 待排序数组
39 | */
40 | public static int[] sort(int[] raw) {
41 | getMaxHeap(raw);
42 | for (int i = raw.length - 1; i > 0; i--) {
43 | int tmp = raw[0];
44 | raw[0] = raw[i];
45 | raw[i] = tmp;
46 | adjust(raw, 0, i);
47 | }
48 | return raw;
49 | }
50 |
51 |
52 | /**
53 | * 将序列排序形成大顶堆
54 | *
55 | * @param raw 待处理数组
56 | */
57 | private static int[] getMaxHeap(int[] raw) {
58 | for (int i = raw.length / 2; i > -1; i--) {
59 | adjust(raw, i, raw.length - 1);
60 | }
61 | return raw;
62 | }
63 |
64 | /**
65 | * 对树中的某个节点进行调整
66 | * 先将堆顶元素值保存,依次对各节点进行调整
67 | *
68 | * @param raw 待调整树
69 | * @param root 调整的位置
70 | * @param length 树节点总数
71 | */
72 | private static int[] adjust(int[] raw, int root, int length) {
73 | int tmp = raw[root];
74 | int child = leftIndex(root);
75 | while (child < length) {
76 | if (child + 1 < length && raw[child] < raw[child + 1]) {
77 | child++;
78 | }
79 | if (tmp >= raw[child]) {
80 | break;
81 | }
82 | raw[root] = raw[child];
83 | root = child;
84 | child *= 2;
85 | child++;
86 | }
87 | raw[root] = tmp;
88 | return raw;
89 | }
90 |
91 | /**
92 | * 获取左子节点的位置
93 | *
94 | * @param i 在堆中的位置序号
95 | *
96 | * @return i 位置的元素的左子节点的位置序号
97 | */
98 | private static int leftIndex(int i) {
99 | return 2 * i + 1;
100 | }
101 |
102 | /**
103 | * 获取左子节点的位置
104 | *
105 | * @param i 在堆中的位置序号
106 | *
107 | * @return i 位置的元素的左子节点的位置序号
108 | */
109 | private static int rightIndex(int i) {
110 | return 2 * i + 2;
111 | }
112 | }
113 |
--------------------------------------------------------------------------------
/merge_sort/pom.xml:
--------------------------------------------------------------------------------
1 |
2 |
17 |
22 | * 将待排序数组按照步长 span 进行分组,然后将每组的元素利用直接插入排序的方法进行排序, 23 | * 每次将 span 折半减小,循环上述操作, 24 | * 当 span =1 时,利用直接插入,完成排序 25 | *
26 | *
27 | * 循环 1:将步长依次折半,对序列进行分组,直到步长为 1
28 | * 循环 2、3:即直接插入排序所需要的两次循环
29 | *
30 | * @author JamesZBL
31 | * @date 2018-02-26
32 | */
33 | public class ShellsSort {
34 |
35 | public static int[] sort(int[] raw) {
36 | int span = raw.length / 2;
37 | while (span >= 1) {
38 | for (int i = span; i < raw.length; i++) {
39 | for (int j = i; j - span > -1; j -= span) {
40 | if (raw[j - span] > raw[j]) {
41 | int tmp = raw[j - span];
42 | raw[j - span] = raw[j];
43 | raw[j] = tmp;
44 | }
45 | }
46 | }
47 | span /= 2;
48 | }
49 | return raw;
50 | }
51 | }
52 |
--------------------------------------------------------------------------------
/simple_choice_sort/README.md:
--------------------------------------------------------------------------------
1 | # 简单选择排序 ( Simple Choice Sort )
--------------------------------------------------------------------------------
/simple_choice_sort/pom.xml:
--------------------------------------------------------------------------------
1 |
2 |
17 |
22 | * a.从待排序序列中,找到关键字最小的元素
23 | * b.如果最小元素不是待排序序列的第一个元素,将其和第一个元素互换
24 | * 从余下的 N - 1 个元素中,找出关键字最小的元素,重复 a、b,直到排序结束
25 | * 循环 1:依次遍历序列当中的每一个元素
26 | * 循环 2:将遍历得到的当前元素依次与余下的元素进行比较,符合最小元素的条件,则交换
27 | *
28 | * @author JamesZBL
29 | * @date 2018-02-26
30 | */
31 | public class SimpleChoiceSort {
32 |
33 | public static int[] sort(int[] raw) {
34 | for (int i = 0; i < raw.length; i++) {
35 | for (int j = i; j < raw.length; j++) {
36 | if (raw[j] < raw[i]) {
37 | int tmp = raw[i];
38 | raw[i] = raw[j];
39 | raw[j] = tmp;
40 | }
41 | }
42 | }
43 | return raw;
44 | }
45 | }
46 |
--------------------------------------------------------------------------------
/straight_insertion_sort/README.md:
--------------------------------------------------------------------------------
1 | # 直接插入排序 ( Straight Insert Sort )
--------------------------------------------------------------------------------
/straight_insertion_sort/pom.xml:
--------------------------------------------------------------------------------
1 |
2 |
17 |
22 | * 将数组中的每个元素与其前面已完成排序的元素进行比较,如果后面的比前面的小,则相互交换位置,直至所有元素都比较完成 23 | * 循环 1:遍历数组 24 | * 循环 2:将当前元素与前面所有完成排序的元素进行比较,后面的小则相互交换 25 | * 26 | * @author JamesZBL 27 | * @date 2018-02-26 28 | */ 29 | public class StraightInserSort { 30 | 31 | public static int[] sort(int[] raw) { 32 | for (int i = 0; i < raw.length; i++) { 33 | for (int j = i - 1; j > -1; j--) { 34 | if (raw[j] > raw[j + 1]) { 35 | int tmp = raw[j]; 36 | raw[j] = raw[j + 1]; 37 | raw[j + 1] = tmp; 38 | } 39 | } 40 | } 41 | return raw; 42 | } 43 | } 44 | --------------------------------------------------------------------------------