About Algorithm: Difference between revisions
From My Limbic Wiki
| (3 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
* Fibonacci | * Fibonacci | ||
* Dichotomy | * Dichotomy | ||
* | * [[QuickSort (Java)]] | ||
* Factorial | * Factorial | ||
* Hanoï tours | * Hanoï tours | ||
* | * [[BubbleSort (Java)]] | ||
** Swapping the adjacent numbers two by two by order | ** Swapping the adjacent numbers two by two by order | ||
==Graphs== | ==Graphs== | ||
| Line 22: | Line 22: | ||
=Prime Numbers= | =Prime Numbers= | ||
* ? | * ? | ||
=Most beautiful Equation= | =Most beautiful Equation= | ||
* '''P=NP''' ([http://www.claymath.org/millennium-problems/p-vs-np-problem Les Équations de Yang Mills]) | * '''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]) | * 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] | * [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
