Thursday, November 3, 2016
Big O notation, time and space complexity
Big O notation, time and space complexity is a very important concept on algorithm analysis.
You can first write up the programming and then analyze it and optimize it. Or, you can first design it and then write up the programming and then analyze it and optimize it. It is a back-forth problem.
Here is a good introduction:
https://www.interviewcake.com/article/java/big-o-notation-time-and-space-complexity
Space complexity:
https://people.cs.clemson.edu/~goddard/texts/theoryOfComputation/18.pdf
Here is a good youtube video on it:
https://www.youtube.com/watch?v=8mBxpDWEKNw
Subscribe to:
Post Comments (Atom)
-
Previously, I wanted to install "script" on Atom to run PHP. And there was some problem, like the firewall. So I tried atom-runner... -
I tried to commit script to bitbucket using sourcetree. I first cloned from bitbucket using SSH, and I got an error, "authentication ... -
https://github.com/boto/boto3/issues/134 import boto3 import botocore client = boto3.client('s3') result = client.list_obje...
Awesome job here, love it! I've got some great interview questions I think your technical readers will enjoy.
ReplyDelete