K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!
Kiran Kumar SundararajanMita PalSoubhik ChakrabortyN. C. MahantiPublished in: CoRR (2011)
Keyphrases
- detection algorithm
- preprocessing
- times faster
- worst case
- classification algorithm
- dynamic programming
- experimental evaluation
- recognition algorithm
- learning algorithm
- optimization algorithm
- computational complexity
- tree structure
- k means
- cost function
- computational cost
- experimental study
- improved algorithm
- optimal solution
- single pass
- estimation algorithm
- simulated annealing
- computationally efficient
- particle swarm optimization
- linear programming
- data sets
- np hard
- evolutionary algorithm
- neural network