About Algorithm: Difference between revisions
From My Limbic Wiki
No edit summary |
|||
| Line 4: | Line 4: | ||
* Horner | * Horner | ||
=Sorting Algoritms= | =Sorting Algoritms= | ||
* Fibonacci | * [[Index.php?title=Binary Search|Binary Search]] | ||
* | * [[Index.php?title=Fibonacci|Fibonacci]] | ||
* [[Index.php?title=MergeSort|MergeSort]] | |||
* [[QuickSort (Java)]] | * [[QuickSort (Java)]] | ||
* | * [[Index.php?title=Bit Manipulation|Bit Manipulation]] | ||
* | * [[Index.php?title=Backtracking|Backtracking]] | ||
* [[Index.php?title=Graph Traversal|Graph Traversal]] | |||
* [[Index.php?title=Union-Find|Union-Find]] | |||
* [[Index.php?title=Dynamic Programming|Dynamic Programming]] | |||
* [[Index.php?title=Greedy|Greedy]] | |||
* [[Index.php?title=Sliding Window / Two Pointers|Sliding Window / Two Pointers]] | |||
* [[BubbleSort (Java)]] | * [[BubbleSort (Java)]] | ||
** Swapping the adjacent numbers two by two by order | ** Swapping the adjacent numbers two by two by order | ||
Revision as of 00:15, 2 October 2025
Most Famous Algorithm
- Euclide
- Karatsuba
- Horner
Sorting Algoritms
- Binary Search
- Fibonacci
- MergeSort
- QuickSort (Java)
- Bit Manipulation
- Backtracking
- Graph Traversal
- Union-Find
- Dynamic Programming
- Greedy
- Sliding Window / Two Pointers
- BubbleSort (Java)
- Swapping the adjacent numbers two by two by order
Graphs
- Dijkstra
- Topologic sorting
Cryptography & Compression
- Shannon-Fano
- Huffman
- Diffie-Hellman
- RSA
Prime Numbers
- ?
Most beautiful Equation
- P=NP (Les Équations de Yang Mills)
- Millenium problems (Clay Mathematics Institute)
- Few ideas
