Revisiting Calculation of Moments of Number of Comparisons used by the Randomized Quick Sort Algorithm.
Sumit Kumar JhaPublished in: CoRR (2016)
Keyphrases
- computational complexity
- memory requirements
- experimental evaluation
- detection algorithm
- randomized algorithm
- learning algorithm
- high accuracy
- space complexity
- optimization algorithm
- computational cost
- preprocessing
- execution times
- cost function
- input data
- linear programming
- small number
- significant improvement
- dynamic programming
- improved algorithm
- particle swarm optimization
- theoretical analysis
- computational effort
- optimal solution
- matching algorithm
- recognition algorithm
- simulated annealing
- convergence rate
- times faster
- probabilistic model
- np hard
- multi objective
- evolutionary algorithm
- decision trees