Blogs about: Big Oh

Featured Blog

Asymptote Analysis

Consider any mathematical function of  T(n) = O(f(n)), which after n exceeds some value cf(n) will exceed the value of T(n) for some constant c. Does this really mean anything useful? I might say in a… more →

The Realm of Wonder

A sudden boom in my visitor stats — 1 comment

hspotorno wrote 2 months ago: Why did we stop doing proofs? I liked proofs. Why are we studying sorting and big-oh? I remember doi … more →

Tags: Tutorial, Hi Maria!

Making sense of the Big Oh! — 1 comment

Autar Kaw wrote 3 months ago: Many students are challenged to understand the nature of Big Oh in relating it to the order of accur … more →

Tags: Differentiation, Numerical methods, central divided difference, numerical differentiation, Taylor series

Big Oh!

algotricks wrote 1 year ago: This is all about the ubiquitous Big Oh! notation. It’s widely popular in CS and often discuss … more →

Tags: asymptotic, Notation, Omega, theta

The Big O! Recipe

Francisca wrote 3 years ago: You think you’ve tried the best thing that this world has to offer you. But you have no idea! … more →

Tags: Inked, Tiroler Nusskuchen, Queque OH!

Asymptote Analysis

Abel Covarrubias wrote 3 years ago: Consider any mathematical function of  T(n) = O(f(n)), which after n exceeds some value cf(n) will e … more →

Tags: Science, Math, logarithmic growth, Lienar growth, "n log n" growth, polynomial growth, exponential growth, algorithm

Technical Interview Questions

lesshumansmorerobots wrote 4 years ago: As I head to the snowy north for the winter break, I’m on a layover in god’s favorite ci … more →

Tags: James, God, Interview, Computer Science, Databases, Jobs, Las Vegas, Brain Teasers

The old well-known(?) puzzle — 8 comments

Danil Glinenko wrote 4 years ago: Suppose we have two sorted arrays: A and B of size n. We would like to know if there is such a pair … more →

Tags: Programming, Puzzle, Array


Related Tags
All →

Follow this tag via RSS