Signin

Deeply Understanding Logarithms In Time Complexities & Their Role In Computer Science

Back To Back SWE • March 20, 2019

Video Thumbnail

You May Also Like

Video Thumbnail

Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)

Back To Back SWE

Video Thumbnail

Logarithms explained Bob Ross style

Tibees

Video Thumbnail

Why Is Merge Sort O(n * log(n))? The Really Really Long Answer.

Back To Back SWE

Video Thumbnail

Big-O Notation - For Coding Interviews

NeetCode

Video Thumbnail

The Ultimate Big O Notation Tutorial (Time & Space Complexity For Algorithms)

Back To Back SWE

Video Thumbnail

Why don't they teach simple visual logarithms (and hyperbolic trig)?

Mathologer

Video Thumbnail

Why The Logarithm Is So Important For Algorithms & Data Structures

Clément Mihailescu

Video Thumbnail

Introduction to Logarithms (1 of 2: Definition)

Eddie Woo

Video Thumbnail

Why the number 0 was banned for 1500 years

Up and Atom

Video Thumbnail

A visual guide to Bayesian thinking

Julia Galef

Video Thumbnail

Learn Big O Notation In 12 Minutes

Web Dev Simplified

Video Thumbnail

Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7)

CS Dojo

Video Thumbnail

What Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Notation.

Back To Back SWE

Video Thumbnail

Big O Notation Series #5: O (n log n) explained for beginners

Kantan Coding

Video Thumbnail

Investigating Heap Sort - Why Is Heap Sort Θ(n * log(n))? An Even Longer Really Long Answer.

Back To Back SWE

Video Thumbnail

This is How Easy It Is to Lie With Statistics

Zach Star

Video Thumbnail

The History of the Natural Logarithm - How was it discovered?

Tarek Said

Back To Back SWE

About

No channel description available.

Latest Posts

Video Thumbnail

The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms

Back To Back SWE

Video Thumbnail

Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems

Back To Back SWE

Video Thumbnail

Maximum Sum Rectangle In A 2D Matrix - Kadane's Algorithm Applications (Dynamic Programming)

Back To Back SWE

Video Thumbnail

The Change Making Problem - Fewest Coins To Make Change Dynamic Programming

Back To Back SWE