Skip to content
/ initialisation-of-an-array-in-logarithmic-time Public

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

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

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

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
README.md
README.md
 
 
init.cpp
init.cpp
 
 

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

cplusplus cpp initialization timecomplexity linear-time logarithmic-complexity

Resources

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages