Skip to content

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).

Notifications You must be signed in to change notification settings

terzinodipaese/initialisation-of-an-array-in-logarithmic-time

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

initialisation-of-an-array-in-logarithmic-time

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).

About

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).

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages