A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci.
Óscar Martín-SánchezCristóbal Pareja-FloresPublished in: ACM SIGCSE Bull. (1995)
Keyphrases
- worst case
- space complexity
- detection algorithm
- computational complexity
- dynamic programming
- expectation maximization
- learning algorithm
- np hard
- k means
- computational cost
- optimal solution
- objective function
- search space
- query language
- relational databases
- simulated annealing
- segmentation algorithm
- information systems