I have often wondered about calculating time complexities. There was always enough theory but never enough practical examples that connected to the theory I was listening to in my Algorithm classes.

One of the fields where I was stuck was calculating the time complexity of recursive algorithms. Sure, you know the methods, but you need to hit your head against the wall a few times before you understand on how to use them.

A simple recursive algorithm for the Master Method example.
Simple example for the Akra Bazzi method.

--

--

--

Javascript Engineer @Povio, Professor @ Erudio Izobraževalni Center and Instructor @SmartNinjaOrg

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Opacity — February Update

10 Signs That You Are Not Ready to Be an Engineering Manager Yet

Discovering Yourself in Web3

| Engineering News-Record

[Codility] CyclicRotation (Swift)

A meetup on “visualizing farm sensor data with Google Cloud Platform”

SAP: The Surface Level

How to Deploy a Telegram Bot with Flask, pyTelegramBotAPI, Gunicorn and PostgreSQL to Heroku

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Boštjan Cigan

Boštjan Cigan

Javascript Engineer @Povio, Professor @ Erudio Izobraževalni Center and Instructor @SmartNinjaOrg

More from Medium

Prims Algorithm

Prims: Greedy when it counts

Prim’s Algorithm

What is Prim’s Algorithm??