About Algorithm: Difference between revisions
From My Limbic Wiki
| Line 10: | Line 10: | ||
* Hanoï tours | * Hanoï tours | ||
* Bubble | * Bubble | ||
** Swapping the adjacent numbers two by two by order | |||
==Graphs== | ==Graphs== | ||
* Dijkstra | * Dijkstra | ||
Revision as of 02:51, 10 May 2019
Most Famous Algorithm
- Euclide
- Karatsuba
- Horner
Sorting Algoritms
- Fibonacci
- Dichotomy
- Divide by two, until result
- Factorial
- Hanoï tours
- Bubble
- Swapping the adjacent numbers two by two by order
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, instantiate Singleton class as New, if not return the existing instance returning the parameter single_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
