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

Week 3 Reflection: Earthquake Process Analogy

How to make a Home Automation Model

Connection of the components with arduino

What you should know about scrum

3 things to read: Google pushes Kubernetes apps; AWS beefs up security; and O'Reilly on open source

Understanding ITCSS: Real case using ITCSS — https://carloscaballero.io

THINKIUM DEVELOPMENT SYSTEM

Software stacks stats: Australian cloud hosting 2020

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

9 Fibonacci Algorithms | The most complete solutions | All In One | Graphical | Easy To Understand

461. Hamming Distance

The Linked List Data Structure

HyperLogLog : Memory vs Accuracy