Various description of Big O – Time complexity algorithms
Understanding the time complexity of Big O and log.
O(log N) means time goes up linearly while the n goes up exponentially. So if it takes 1 second to compute 10 elements, it will take 2 seconds to compute 100 elements, 3 seconds to compute 1000 elements, and so on. https://stackoverflow.com/a/2307330/2489973
What’s logb(n)?
It is the number of times you can repeatedly cut a log of length n into b equal parts before reaching a section of size 1.
https://stackoverflow.com/a/2480061/2489973
The Stackoverflow link covers complexity very nicely. I am putting it here for easy reference.
Big O complexities cheatsheet
Related Articles
List users in windows
List users and groups in Windows Type Users in search box or enter lusrmgr.msc in Run dialog box Win+R -> lusrmgr.msc -> enter
Using scp to copy files
Copy file from local pc to remote server scp <filename> <useronremotesystem>@<ipaddressofremotesystem>:<remotedirpath>/<remotefilename> scp mytext.txt user2@192.168.1.25:/home/user2/mytext.txt Copy file from remote server to local pc…
Docker and Docker Compose
Docker Compose docker-compose.yml file contains the command to run, start, stop all the containers and services mentioned inside the file. up build or create or recreate container and start it docker-compose up build build the container but won’t start it…