Best Sorting Algorithm for Nearly Sorted Lists.
Curtis R. CookDo Jin KimPublished in: Commun. ACM (1980)
Keyphrases
- theoretical analysis
- computational cost
- experimental evaluation
- k means
- optimization algorithm
- detection algorithm
- computational complexity
- cost function
- preprocessing
- times faster
- objective function
- experimental study
- dynamic programming
- worst case
- high accuracy
- input data
- matching algorithm
- classification algorithm
- probabilistic model
- convergence rate
- single pass
- segmentation algorithm
- sorting algorithms
- computationally efficient
- expectation maximization
- learning algorithm
- np hard
- significant improvement
- search space
- search algorithm
- multiscale
- similarity measure
- image sequences