Traditional Generalization Theory notions include VC dimension, Rademacher complexity and PAC-Bayes bounds. VC Dimension and Dead NeuronsThe Vapnik–Chervonenkis (VC) dimension is…

Continue Reading# complexity

## A Gentle Explanation of Logarithmic Time Complexity

Not really. Your input could be 2 letters or it could be twelve billion. It could be running on an…

Continue Reading## What’s the Big O-deal?

What’s the Big O-deal?Yet another breakdown of Big O and runtime complexityRachel LumBlockedUnblockFollowFollowingMay 1Forrest GumpThere are probably a good hundred other…

Continue Reading## Crash early and crash often for more reliable software

Like the null check in the previous section, an assertion failure is trivial to debug. The fix may either be…

Continue Reading## The big D with big O

A value is said to be asymptotic if it approaches an infinite limit but never reaches it. When we say…

Continue Reading## Optimizing Inefficiency: Human folly and the quest for the worst sorting algorithm

Optimizing Inefficiency: Human folly and the quest for the worst sorting algorithmDaniel MillerBlockedUnblockFollowFollowingApr 3(Image source)Lookup Bogosort, Slowsort, or Stooge sort…

Continue Reading## Asymptotic Analysis Explained with Pokémon: A Deep Dive into Complexity Analysis

This is the complexity of the Merge Sort algorithm. If we fit the recurrence relation for merge sort in the…

Continue Reading## How to use the Tower of Hanoi problem to illustrate algorithms

How to use the Tower of Hanoi problem to illustrate algorithmsA simple game demonstrates recursion, pseudocode, time complexity, and space…

Continue Reading