This procedure initialise an array in logarithmic time, that is O(log n). That is generally asymptotically better than the classic procedure, which takes linear time O(n).
-
Updated
May 19, 2021 - C++
This procedure initialise an array in logarithmic time, that is O(log n). That is generally asymptotically better than the classic procedure, which takes linear time O(n).
Add a description, image, and links to the logarithmic-complexity topic page so that developers can more easily learn about it.
To associate your repository with the logarithmic-complexity topic, visit your repo's landing page and select "manage topics."