About Algorithm: Difference between revisions
From My Limbic Wiki
| Line 19: | Line 19: | ||
=Prime Numbers= | =Prime Numbers= | ||
* ? | * ? | ||
= | =Singleton= | ||
* Singleton | * '''Class Singleton''' with a private constructor | ||
** Private static parameter '''single_instance''' set to null | |||
** Private static Method '''getInstance():''' if the parameter is null, instanciate singleton class, if not return the existing instance; | |||
Every instantiation has to be called as: '''Singleton.getInstance();''' | |||
=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] | ||
Revision as of 02:47, 10 May 2019
Most Famous Algorithm
- Euclide
- Karatsuba
- Horner
Sorting Algoritms
- Fibonacci
- Dichotomy
- Factorial
- Hanoï tours
- Bubble
Graphs
- Dijkstra
- Topologic sorting
Cryptography & Compression
- Shannon-Fano
- Huffman
- Diffie-Hellman
- RSA
Prime Numbers
- ?
Singleton
- Class Singleton with a private constructor
- Private static parameter single_instance set to null
- Private static Method getInstance(): if the parameter is null, instanciate singleton class, if not return the existing instance;
Every instantiation has to be called as: Singleton.getInstance();
Most beautiful Equation
- P=NP (Les Équations de Yang Mills)
- Millenium problems (Clay Mathematics Institute)
- Few ideas
