The Exponential Threshold
MCQAn algorithm in O(2^n) processes n = 40 elements in about 18 minutes. Assuming the time doubles for each element added, how long will it take (in order of magnitude) for n = 50?
An algorithm in O(2^n) processes n = 40 elements in about 18 minutes. Assuming the time doubles for each element added, how long will it take (in order of magnitude) for n = 50?