# An intuition behind fast computation

## What really makes it faster?

The dream of every niche software engineer — *to get that speeeeeeeed.*

The adrenaline rush of optimizing your code to run faster; You know what I am talking about!

(Not a Medium member? Read this for free via my friend link!)

The pursuits are so intense that we have stuff like the **one billion row challenge**, where the goal is to push the boundaries of how fast you can parse 1 billion rows.

One of my very first introductions to fast computing was “algorithmic” in nature.

I did my undergraduate degree in electronics and communication engineering, and one of the concepts we learned in the curriculum was the “**Fast Fourier Transform****.**” As the name suggests, it's a faster way to do a standard math operation called the **Fourier transform**.

That was one of the earliest times when I got the intuition that you can speed up the computation by developing better algorithms.

But what really makes an algorithm better/faster?

When you perform a lesser number of steps to get your answer.

In the context of computers, the raw answer is when your code executes the least number of assembly instructions.