Correction to: Minimum average case time complexity for sorting algorithms
نویسندگان
چکیده
منابع مشابه
Improved Average Complexity for Comparison-Based Sorting
This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is n lg n− 1.4427n+O(log n). For many efficient algorithms, the first n lg n term is easy to achieve and our focus is on the (negative) constant factor of the linear term. The current best value is −1.3999 for the MergeInsertion sort. Our new value is −1.4106, nar...
متن کاملCorrection to 'Minimum Complexity Density Estimation'
Manuscript submitted July 1991. A. R. Barron is with the Department of Statistics and the Department of Electrical and Computer Engineering, University of Illinois, 101 Illini Hall, 725 S. Wright Street, Champaign, IL. 91820. T. M. Cover is with the Departments of Electrical Engineering and Statistics, Durand, Room 121, Stanford University, Stanford, CA 94305. IEEE Log Number 9103053. ‘A. R. Ba...
متن کاملAn Average Case Time Complexity Estimator for Black-box Functions
Average case time complexity is widely used to evaluate the efficiency of an algorithm [2]. Given a blackbox function, if a tester wants to know the average case time complexity, he/she has to analyze the source code and make input assumption so as to know the average case of the function. Although that is feasible, it is time consuming and that makes the testing process no longer automatic. In...
متن کاملDrift analysis and average time complexity of evolutionary algorithms
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including conditions under which an EA will take no more than polynomial time (in problem size) to solve a prob...
متن کاملAverage Time Complexity
We extend Levin's theory of average polynomial time to arbitrary time-bounds in accordance with the following general principles: (1) It essentially agrees with Levin's notion when applied to polynomial time-bounds. (2) If a language L belongs to DTIME(T(n)), for some time-bound T (n), then every distributional problem (L;) is T on the-average. (3) If L does not belong to DTIME(T(n)) almost eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iran Journal of Computer Science
سال: 2023
ISSN: ['2520-8438', '2520-8446']
DOI: https://doi.org/10.1007/s42044-023-00155-8