A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Ioannis K. PaparrizosPublished in: CoRR (2010)
Keyphrases
- worst case
- lower bound
- running times
- np hard
- upper bound
- constant factor
- computational complexity
- average case
- space complexity
- error bounds
- learning algorithm
- detection algorithm
- memory requirements
- approximation algorithms
- greedy algorithm
- computational effort
- high accuracy
- complexity bounds
- theoretical analysis
- times faster
- small number
- experimental evaluation
- cost function
- convergence rate
- k means
- recognition algorithm
- search space
- preprocessing
- single scan
- optimization algorithm
- randomized algorithm
- optimal solution
- objective function
- decision trees