Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/m9rco/algorithm-php
๐ญ๐ญuniting the internal work in a way that is in PHP
https://github.com/m9rco/algorithm-php
arithmetic composer learning php php-library php5 php7 phper
Last synced: about 17 hours ago
JSON representation
๐ญ๐ญuniting the internal work in a way that is in PHP
- Host: GitHub
- URL: https://github.com/m9rco/algorithm-php
- Owner: m9rco
- License: mit
- Created: 2017-06-17T04:53:07.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2023-12-08T06:48:31.000Z (about 1 year ago)
- Last Synced: 2025-01-04T01:12:46.957Z (8 days ago)
- Topics: arithmetic, composer, learning, php, php-library, php5, php7, phper
- Language: PHP
- Homepage:
- Size: 229 KB
- Stars: 1,390
- Watchers: 80
- Forks: 486
- Open Issues: 8
-
Metadata Files:
- Readme: README-EN.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
- Security: SECURITY.md
Awesome Lists containing this project
- php-awesome - ็จ PHP ็ๆนๅผๅฎ็ฐ็ๅ็ฑป็ฎๆณๅ้
- awesome-hacking-lists - m9rco/algorithm-php - ๐ญ๐ญuniting the internal work in a way that is in PHP (PHP)
README
โ
:whale:A collection of algorithms that are implemented in PHP:whale:
ไธญๆ็ใ
## Simple structure,
```
โโโPackage
โ โโโ Sort
โ โ โโโ BubbleSort.php
โ โ โโโ QuickSort.php
โ โ โโโ ShellSort.php
โ โ โโโ MergeSort.php
โ โ โโโ InsertSort.php
โ โ โโโ SelectSort.php
โ โ
โ โโโ Query ๆฅๆพ็ฏ
โ โ โโโ BinaryQuery.php
โ โ โโโ InseertQuery.php
โ โ โโโ FibonacciQuery.php
โ โ โโโ BFSQuery.php
โ โ โโโ Kmp.php
โ โ โโโ DijkstraQuery.php
โ โ โโโ QulickQuery.php
โ โ
โ โโโ Other ๅ
ถไป
โ โโโ MonkeyKing.php
โ โโโ DynamicProgramming.php
โ โโโ Fibonacci.php
โ โโโ StealingApples.php
โ โโโ HanoiGames.php
โ โโโ BidirectionalQueue.php
โ โโโ ColorBricks.php
โ โโโ GetCattle.php
โ โโโ OnlyNumbers.php
โ โโโ Interval.php
โ โโโ Maze.php
โ โโโ AntsClimb.php
โ โโโ Encryption.php
โ โโโ ElevatorDispatch.php
โ โโโ kmp.php
โ โโโ TraversalOfBinary.php
โ โโโ PointInTriangle.php
โ โโโ BigSmallReplace.php
โ โโโ Knapsack.php
โ โโโ Solution.php
โ โโโ RotationSort.php
โ โโโ Square.php
โ โโโ Prim.php
โ โโโ CartesianProduct.php
โ โโโ Square.php
โ โโโ Judge.php
โ โโโ Factorial.php
| โโโ HashTable.php
| โโโ RotateSort.php
โ
โโโLICENSE
โโโREADME.md
```
## What to do๏ผ
```
To record their understanding algorithms, data structure, the process of simple comprehensive and detailed as possible, let the learning algorithm using flexible, refueling(เธ โขฬ_โขฬ)เธ
```
## logarithmic
log10100 It's equivalent to saying, "how many tens do you multiply?" the answer is, of course, two
so log10100=2๏ผThe logarithmic operation is the inverse of the power operation
| left | right |
| ------------------ | --------------------- |
| 23 = 8 | log28 = 3 |
| 24 = 16 | log216 = 4 |
| 25 = 32 | log232 = 5 |
If you don't, we won't wait for you
## The elapsed time
Take binary search for example, how much time can you save by using it? Simply look for the Numbers and if the list contains 100 Numbers, you need to guess 100 times.
In other words, the number of guesses is the same as the length of the list, which is called linear time, while binary search is different if the list contains 100 elements
It takes up to seven times, and if the list contains four billion digits, it should be guessed 32 times, while the running time of the subsearch is logarithmic time `O(log)`
## Big O notation
The big O notation is a special representation of how fast the algorithm can be. There's a diaosi. In fact, you often have to copy other people's code.
In this case, you know how fast these algorithms are
- The running time of the algorithm increases at different speeds
- For example, the difference between a simple find and a binary search
| element | Easy to find | Binary search |
| ------------- | ------------ | ------------- |
| 100 | 100ms | 7ms |
| 10000 | 10s | 14ms |
| 1 000 000 000 | 11day | 30ms |
- ` O ` said hair is pointed out that how fast algorithms, such as list contains ` n ` element, a simple search need to check each element, so you need to perform ` n ` time operations
Using large ` O ` said ` O (n) to make this operation `, binary search need to perform logn using large ` O ` said to`O(log n)`
- Some common big O runtime
- O(log n) ,It's also called log time, and this algorithm includes binary algorithms
- O(n),Also known as linear time, this algorithm includes simple lookups.
- O(n * log n) Quick sort
- O(n2),Selection sort
- O(n!) Factorial time
- Here is the point
- The speed of the algorithm is not the time, but the growth of operands
- When we talk about the speed of the algorithm, what we're talking about is how fast will it run as the input increases
- The running time of the algorithm is expressed in large O notation
- O(log n) is faster than O (n), and the more elements that need to be searched, the more the former is faster than the latter
## A simple comparison of recursion and loops๏ผ
1. From a procedural point of view, the recursion manifests itself as calling itself, and the loop does not have this form.
2. Recursive proceed from the ultimate goal of the problem, and gradually to a complex problem into a simple problem, and simple question solution and complicated problem, at the same time the presence of the benchmark, can eventually get a problem, is the reverse. And the circulation is from the simple question, step by step forward development, finally get the question, is positive.
3. Any cycle can be represented by recursion, but it is necessary to use the loop to achieve recursion (except for one-way recursion and tail recursion), and the stack structure must be introduced to stack the stack.
4.In general, non-recursive efficiency is higher than recursion. And recursive function calls are expensive and recursive times are limited by stack size.
## Progressive learning
1. Fork ๆ็้กน็ฎๅนถๆไบคไฝ ็ `idea`
2. Pull Request
3. Merge
## ็บ ้
If you find something wrong, you can initiate a [issue](https://github.com/PuShaoWei/designPatterns-go/issues)or [pull request](https://github.com/PuShaoWei/designPatterns-go/pulls),I will correct it in time
> ่กฅๅ
:ๅ่ตทpull request็commit message่ฏทๅ่ๆ็ซ [Commit message ๅ Change log ็ผๅๆๅ](http://www.ruanyifeng.com/blog/2016/01/commit_message_change_log.html)
## Contributors
Thanks for the issue or pull request of the following friends:
- [hailwood ](https://github.com/hailwood)
- [zhangxuanru](https://github.com/zhangxuanru)
- [ifreesec](https://github.com/ifreesec)
- [openset](https://github.com/openset)
- [Neroxiezi](https://github.com/Neroxiezi)
## License
MIT