├── .gitignore ├── LICENSE ├── README.md ├── _config.yml ├── composer.json ├── example.php └── src └── Algorithm.php /.gitignore: -------------------------------------------------------------------------------- 1 | # Created by .ignore support plugin (hsz.mobi) 2 | ### Composer template 3 | composer.phar 4 | /vendor/ 5 | 6 | # Commit your application's lock file http://getcomposer.org/doc/01-basic-usage.md#composer-lock-the-lock-file 7 | # You may choose to ignore a library lock file http://getcomposer.org/doc/02-libraries.md#lock-file 8 | # composer.lock 9 | ### macOS template 10 | *.DS_Store 11 | .AppleDouble 12 | .LSOverride 13 | 14 | # Icon must end with two \r 15 | Icon 16 | 17 | 18 | # Thumbnails 19 | ._* 20 | 21 | # Files that might appear in the root of a volume 22 | .DocumentRevisions-V100 23 | .fseventsd 24 | .Spotlight-V100 25 | .TemporaryItems 26 | .Trashes 27 | .VolumeIcon.icns 28 | .com.apple.timemachine.donotpresent 29 | 30 | # Directories potentially created on remote AFP share 31 | .AppleDB 32 | .AppleDesktop 33 | Network Trash Folder 34 | Temporary Items 35 | .apdisk 36 | ### JetBrains template 37 | # Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio and Webstorm 38 | # Reference: https://intellij-support.jetbrains.com/hc/en-us/articles/206544839 39 | 40 | # User-specific stuff: 41 | .idea/**/workspace.xml 42 | .idea/**/tasks.xml 43 | .idea/dictionaries 44 | 45 | # Sensitive or high-churn files: 46 | .idea/**/dataSources/ 47 | .idea/**/dataSources.ids 48 | .idea/**/dataSources.xml 49 | .idea/**/dataSources.local.xml 50 | .idea/**/sqlDataSources.xml 51 | .idea/**/dynamic.xml 52 | .idea/**/uiDesigner.xml 53 | 54 | # Gradle: 55 | .idea/**/gradle.xml 56 | .idea/**/libraries 57 | 58 | # Mongo Explorer plugin: 59 | .idea/**/mongoSettings.xml 60 | 61 | ## File-based project format: 62 | *.iws 63 | 64 | ## Plugin-specific files: 65 | 66 | # IntelliJ 67 | /out/ 68 | 69 | # mpeltonen/sbt-idea plugin 70 | .idea_modules/ 71 | 72 | # JIRA plugin 73 | atlassian-ide-plugin.xml 74 | 75 | # Crashlytics plugin (for Android Studio and IntelliJ) 76 | com_crashlytics_export_strings.xml 77 | crashlytics.properties 78 | crashlytics-build.properties 79 | fabric.properties 80 | 81 | -------------------------------------------------------------------------------- /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, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "{}" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright {yyyy} {name of copyright owner} 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Algorithm 2 | 3 | ## Installation 4 | 5 | The preferred method of installation is via [Packagist](https://packagist.org/) and [Composer](https://getcomposer.org/). Run the following command to install the package and add it as a requirement to your project's `composer.json`: 6 | 7 | ```bash 8 | composer require frowhy/algorithm 9 | ``` 10 | 11 | ## Example 12 | ```php 13 | use Frowhy\Algorithm\Algorithm; 14 | 15 | require_once __DIR__ . '/vendor/autoload.php'; 16 | 17 | $total = 20; 18 | $arr = []; 19 | for ($i = 0; $i < $total; $i++) { 20 | $arr[] = rand(-10000, 10000); 21 | } 22 | 23 | $quickSort = Algorithm::quickSort($arr); 24 | $bubbleSort = Algorithm::bubbleSort($arr); 25 | $selectionSort = Algorithm::selectionSort($arr); 26 | $insertionSort = Algorithm::insertionSort($arr); 27 | $shellSort = Algorithm::shellSort($arr); 28 | $mergeSort = Algorithm::mergeSort($arr); 29 | $countingSort = Algorithm::countingSort($arr); 30 | $heapSort = Algorithm::heapSort($arr); 31 | 32 | print_r([ 33 | '原数组' => $arr, 34 | '快速排序' => $quickSort, 35 | '冒泡排序' => $bubbleSort, 36 | '选择排序' => $selectionSort, 37 | '插值排序' => $insertionSort, 38 | '希尔排序' => $shellSort, 39 | '归并排序' => $mergeSort, 40 | '计算排序' => $countingSort, 41 | '堆排序' => $heapSort, 42 | ]); 43 | ``` -------------------------------------------------------------------------------- /_config.yml: -------------------------------------------------------------------------------- 1 | theme: jekyll-theme-modernist -------------------------------------------------------------------------------- /composer.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "frowhy/algorithm", 3 | "description": "八大排序算法", 4 | "type": "library", 5 | "license": "apache", 6 | "authors": [ 7 | { 8 | "name": "frowhy", 9 | "email": "frowhy@gmail.com" 10 | } 11 | ], 12 | "minimum-stability": "stable", 13 | "autoload": { 14 | "psr-4": { 15 | "Frowhy\\Algorithm\\": "src/" 16 | } 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /example.php: -------------------------------------------------------------------------------- 1 | $arr, 54 | '快速排序' => $quickSort, 55 | '冒泡排序' => $bubbleSort, 56 | '选择排序' => $selectionSort, 57 | '插值排序' => $insertionSort, 58 | '希尔排序' => $shellSort, 59 | '归并排序' => $mergeSort, 60 | '计算排序' => $countingSort, 61 | '堆排序' => $heapSort, 62 | ]); 63 | -------------------------------------------------------------------------------- /src/Algorithm.php: -------------------------------------------------------------------------------- 1 | $arr[$j + 1]) { 81 | $arr = self::array_swap($arr, $j, $j + 1); 82 | } 83 | } 84 | } 85 | 86 | return $arr; 87 | } 88 | 89 | public static function selectionSort($arr) { 90 | if (! is_array($arr)) { 91 | return false; 92 | } 93 | $len = count($arr); 94 | if ($len <= 1) { 95 | return $arr; 96 | } 97 | 98 | for ($i = 0; $i < $len; $i++) { 99 | $min_i = $arr[$i]; 100 | $index = $i; 101 | $min_j = $i + 1; 102 | for ($j = $min_j; $j < $len; $j++) { 103 | if ($arr[$j] < $min_i) { 104 | $min_i = $arr[$j]; 105 | $index = $j; 106 | } 107 | } 108 | if ($i < $index) { 109 | $arr = self::array_swap($arr, $i, $index); 110 | } 111 | } 112 | 113 | return $arr; 114 | } 115 | 116 | public static function insertionSort($arr) { 117 | if (! is_array($arr)) { 118 | return false; 119 | } 120 | $len = count($arr); 121 | if ($len <= 1) { 122 | return $arr; 123 | } 124 | 125 | for ($i = 0; $i < $len; $i++) { 126 | $pre_i = $i - 1; 127 | $current = $arr[$i]; 128 | while ($pre_i >= 0 && $arr[$pre_i] > $current) { 129 | $arr[$pre_i + 1] = $arr[$pre_i]; 130 | $pre_i -= 1; 131 | } 132 | $arr[$pre_i + 1] = $current; 133 | } 134 | 135 | return $arr; 136 | } 137 | 138 | public static function shellSort($arr) { 139 | if (! is_array($arr)) { 140 | return false; 141 | } 142 | $len = count($arr); 143 | if ($len <= 1) { 144 | return $arr; 145 | } 146 | 147 | $gap = 1; 148 | $pre_i = $len / 3; 149 | while ($gap < $pre_i) { 150 | $gap = $gap * 3 + 1; 151 | } 152 | 153 | while ($gap > 0) { 154 | for ($i = 0; $i < $len; $i++) { 155 | $temp = $arr[$i]; 156 | $j = $i - $gap; 157 | 158 | while ($j >= 0 and $arr[$j] > $temp) { 159 | 160 | $arr[$j + $gap] = $arr[$j]; 161 | $j -= $gap; 162 | } 163 | 164 | $arr[$j + $gap] = $temp; 165 | } 166 | 167 | $gap = floor($gap / 3); 168 | } 169 | 170 | return $arr; 171 | } 172 | 173 | public static function mergeSort(&$arr) { 174 | if (! is_array($arr)) { 175 | return false; 176 | } 177 | $len = count($arr); 178 | if ($len <= 1) { 179 | return $arr; 180 | } 181 | 182 | $mid = $len >> 1; 183 | $left = array_slice($arr, 0, $mid); 184 | $right = array_slice($arr, $mid); 185 | static::mergeSort($left); 186 | static::mergeSort($right); 187 | if (end($left) <= $right[0]) { 188 | $arr = array_merge($left, $right); 189 | } else { 190 | for ($i = 0, $j = 0, $k = 0; $k <= $len - 1; $k++) { 191 | if ($i >= $mid && $j < $len - $mid) { 192 | $arr[$k] = $right[$j++]; 193 | } elseif ($j >= $len - $mid && $i < $mid) { 194 | $arr[$k] = $left[$i++]; 195 | } elseif ($left[$i] <= $right[$j]) { 196 | $arr[$k] = $left[$i++]; 197 | } else { 198 | $arr[$k] = $right[$j++]; 199 | } 200 | } 201 | } 202 | 203 | return $arr; 204 | } 205 | 206 | public static function countingSort($arr) { 207 | if (! is_array($arr)) { 208 | return false; 209 | } 210 | $len = count($arr); 211 | if ($len <= 1) { 212 | return $arr; 213 | } 214 | 215 | $count = $sorted = []; 216 | $min = min($arr); 217 | $max = max($arr); 218 | for ($i = 0; $i < $len; $i++) { 219 | $count[$arr[$i]] = isset($count[$arr[$i]]) ? $count[$arr[$i]] + 1 : 1; 220 | } 221 | for ($j = $min; $j <= $max; $j++) { 222 | while (isset($count[$j]) && $count[$j] > 0) { 223 | $sorted[] = $j; 224 | $count[$j]--; 225 | } 226 | } 227 | 228 | return $sorted; 229 | } 230 | 231 | public static function heapSort($arr) { 232 | if (! is_array($arr)) { 233 | return false; 234 | } 235 | global $len; 236 | $len = count($arr); 237 | if ($len <= 1) { 238 | return $arr; 239 | } 240 | 241 | for ($i = $len; $i >= 0; $i--) { 242 | self::heapify($arr, $i); 243 | } 244 | 245 | return $arr; 246 | } 247 | 248 | static function heapify($arr, $i) { 249 | $left = 2 * $i + 1; 250 | $right = 2 * $i + 2; 251 | $largest = $i; 252 | 253 | global $len; 254 | if ($left < $len && $arr[$left] > $arr[$largest]) { 255 | $largest = $left; 256 | } 257 | if ($right < $len && $arr[$right] > $arr[$largest]) { 258 | $largest = $right; 259 | } 260 | if ($largest != $i) { 261 | self::array_swap($arr, $i, $largest); 262 | self::heapify($arr, $largest); 263 | } 264 | } 265 | } 266 | --------------------------------------------------------------------------------