{"version":"1.0","type":"link","title":"Average-case complexity - Newikis","description":"In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs. It is frequently contrasted with worst-case complexity which considers the maximal complexity of…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}