Algorithimic Complexity Cheatsheet

I had a customer recently ask me why some things we are doing at work are better than other traditional methods. I explained in a lay sense why our approach was more effort up front but over time would greatly reduce the effort to support the system and greatly reduce the time it would take to solve various issues. Later though I realized I could have explained the problem as Algorithmic Complexity or the definition of a function that explains the complexity in time (number of steps needed to run) and complexity in space (memory needed to run). So I decided a needed a refresher in figuring out algorithmic or computational complexity and found this useful cheat sheet here. I also found this article pretty useful. While in my case it’s to help explain how a specific approach to a problem is more scalable than another there are common questions for computer programmers and engineers in job interviews and I suspect that both the chart and article are good resources for interviewing for positions.

About ordo tacitus

ordo tacitus
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s