Asymptotic expressions for moments of number of comparisons used by the randomized quick sort algorithm.
Sumit Kumar JhaPublished in: CoRR (2016)
Keyphrases
- computational effort
- computational cost
- optimization algorithm
- worst case
- execution times
- computational complexity
- cost function
- experimental evaluation
- learning algorithm
- times faster
- objective function
- high accuracy
- computationally efficient
- convergence rate
- randomized algorithm
- improved algorithm
- detection algorithm
- initial set
- recognition algorithm
- convex hull
- simulated annealing
- cluster centers
- input data
- linear programming
- k means
- optimal solution
- feature extraction
- space complexity
- expectation maximization
- single scan
- tree structure
- segmentation algorithm
- data sets
- upper bound
- dynamic programming
- genetic algorithm