About Algorithm: Difference between revisions
From My Limbic Wiki
(Page créée avec « =Define Algorithm= =Design Pattern= ») |
|||
| (13 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
= | =Most Famous Algorithm= | ||
= | * Euclide | ||
* Karatsuba | |||
* Horner | |||
=Sorting Algoritms= | |||
* Fibonacci | |||
* Dichotomy | |||
* [[QuickSort (Java)]] | |||
* Factorial | |||
* Hanoï tours | |||
* [[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''' ([http://www.claymath.org/millennium-problems/p-vs-np-problem Les Équations de Yang Mills]) | |||
* Millenium problems ([http://www.claymath.org/millennium-problems/ Clay Mathematics Institute]) | |||
* [https://www.superprof.fr/blog/equations-de-maths-et-histoire/#8-identite-euler Few ideas] | |||
Latest revision as of 04:38, 30 May 2019
Most Famous Algorithm
- Euclide
- Karatsuba
- Horner
Sorting Algoritms
- Fibonacci
- Dichotomy
- QuickSort (Java)
- Factorial
- Hanoï tours
- 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
