Algorithm - Polymorphic
Table of Contents
About
An algorithm is said to be polymorphic if
- the same method can be used on many different implementations.
- algorithms are reusable functionality.
Articles Related
Recommended Pages
Algorithm 21 pages
- Asymptotic Analysis
- Big O Notation
- (Case|problem) analysis
- Complexity (Big O)
- Data Compression
- Performance - Constant Time - O(1)
- Cost (Performance Metrics)
- Divide-and-Conquer algorithm design paradigm
- Fast Fourier Transformation (FFT) (time to frequency and vice versa)
- Greedy
- (Guiding Principle|Guide Line)
- Tractable / Intractable Problem
- Lifecycle
- Linear Time - O(n)
- NP Complete (Nondeterministic Polynomial Time Complete)
- Polymorphic
- Polynomial time algorithms
- Problem
- Round Robin
- (Performance|Running Time|Fast)
- Documentation / Reference