Algorithm

In the previous article, we used asymtotic notation to measure the worst-case running time of the merge sort algorithm.

There would always be great techniques to build or design anything in any field. As well as we will also learn how to design our algorithm to solve problems.

As the proverb says: “There are many ways to go to Rome”. Different algorithms solving the same problem could be dramatically different in terms of their efficiency. How do we compare them?

After understanding about why we should learn to write good algorithms and now what? what exactly is an algorithm?

The computer hardware performance has been growing so fast, even to execute our crappy algorithm. So, why do we need to learn to write a good one?