A Hybrid of Quicksort with O(n log n) Worst Case Complexity.
Johannes RöhrichPublished in: Inf. Process. Lett. (1982)
Keyphrases
- worst case
- lower bound
- upper bound
- approximation algorithms
- average case
- np hard
- greedy algorithm
- space complexity
- complexity bounds
- sample size
- error bounds
- real time
- running times
- computational complexity
- theoretical analysis
- worst case analysis
- worst case scenario
- probabilistic model
- expert systems
- objective function
- information systems