In Defense of Big O
Tags: beginners, career, computerscience
Published: 2019-10-06 18:41:50

---
title: In Defense of Big O
published: true
date: 2019-10-06 18:10:36 UTC
tags: beginners, career, computerscience
canonical_url: https://www.codingblocks.net/programming/in-defense-of-big-o/
---

![](https://www.codingblocks.net/wp-content/uploads/2019/10/image.png)

One of the few things that developers can agree on is that the interview process is terribly broken. There are ideas about how to fix it but the industry has yet to come to a consensus on a better way forward.   
  
Many developers are particularly aggravated by the way some organizations insist on “academic” interview problems that test developers skill with algorithms and ([Big O](https://en.wikipedia.org/wiki/Big_O_notation)) algorithmic analysis. The argument is that these types of problems are often irrelevant to the job, rewarding antiquated knowledge over practical skill, and are biased in favor of developers with more time and resources to spend on preparation.  
  
Now, before we continue let me get this out of the way:  
**I agree with those arguments!**

[![Nothing to see here, go visit XKCD to see the hover!](https://www.explainxkcd.com/wiki/images/d/dd/waiting_for_the_but.png)](https://www.explainxkcd.com/wiki/index.php/2146:_Waiting_for_the_But)<figcaption> <a href="https://www.xkcd.com/2146/">https://www.xkcd.com/2146/</a> <br></figcaption>

As a developer with social media accounts I am also inundated with jokes, memes, and tweets that essentially boil down to “Big O is dumb” and I worry that reductionist platitudes are unfairly tainting how new developers view important tools and techniques.

## **Sometimes it’s really important**

Maybe your dream job doesn’t require a lot of data and compute, but that doesn’t mean it’s not important for others. Algorithms, data structures, and Big O can certainly come in handy here, but so does system design, scalability, and having a good [grasp on the numbers](https://gist.github.com/jboner/2841832). I don’t know how to rank the importance of these subjects but I’ll wager that the developers working on things like databases, search engines, operating systems, and graphical rendering (and many other fields) are critically dependent on having a shared and unambiguous language for understanding how programs scale in terms of space and time complexity.

If you are interested in these types of subjects, then you are going to need to study up on the underlying principles. I agree that the developers who face these types of problems generally have more time than an interview takes to optimally solve them but it is important to show your interviewers that you share (or are capable of) the same basis for precise communication.

**Examples:**

- [LSM vs B-Trees for databases](https://blog.yugabyte.com/a-busy-developers-guide-to-database-storage-engines-the-basics/)
- [The Dynamo Paper](http://www.dcs.bbk.ac.uk/~dell/teaching/cc/book/ditp/ditp_ch4.pdf)
- [The Big Table Paper](https://static.googleusercontent.com/media/research.google.com/en//archive/bigtable-osdi06.pdf)
- [Data Structures in Operating Systems](https://www.ijser.org/researchpaper/The-Role-of-Data-Structures-in-Multiple-Disciplines-of-Computer-Science-A-Review.pdf)
- [3D Rendering Techniques](https://en.wikipedia.org/wiki/3D_rendering) 

## **Also, algorithms are awesome!**

Having a good understanding of algorithms and data structures is like a super power. I’ve seen (and probably written) lots of …uh…_interesting_…. solutions for dealing with dependency management when a simple “[top sort](https://en.wikipedia.org/wiki/Topological_sorting)” would have done the trick faster and more correctly. Being able to recognize and classify a problem can go a long way towards solving it. Additionally, perusing algorithms can lead to sparks of inspiration, letting you solve problems that you didn’t even realize you had.  
  
Here’s a list of known algorithms to get your motor running:  
[https://en.wikipedia.org/wiki/List\_of\_algorithms](https://en.wikipedia.org/wiki/List_of_algorithms)

## **Summary**

Interviewing is difficult with many organizations [cargo culting](https://en.wikipedia.org/wiki/Cargo_cult_programming) the FANG interview process. Despite that, the study of algorithms, data structures, and algorithmic analysis is still really useful for many programmers, and it’s also kinda awesome.

[![](https://www.codingblocks.net/wp-content/uploads/2019/10/image.png)](https://www.youtube.com/watch?v=k4RRi_ntQc8)<figcaption><a href="https://www.youtube.com/watch?v=k4RRi_ntQc8">Tell ’em Barack!</a></figcaption>

PS: Looking for some resources to get started? Check out these great articles on [dev.to](https://dev.to/search?q=big%20o)!  
 [  
](https://dev.to/search?q=big%20o)

PPS: Like this kind of topic? Check out the [podcast](https://www.codingblocks.net/) in your app of choice!