Cracking The Coding Interview 6th Edition PDF

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

Cracking

the Coding Interview 6th edition

Table of Contents
Introduction

BIg(O)Notation

Cracking the Coding Interview 6th edition

Cracking the coding interview 6th edition


Go over all the programming questions and keep reminders and cheat notes.

Introduction

Cracking the Coding Interview 6th edition

BIg(O)Notation
Time Complexity
O(1) constant time. This is never counted. O(n) this mean it takes n time. O(n) is linear time.
No matter how big the constant O(1) is linear will surpass it at some point.
Industry meaning of Big O notation is more academia Big Theta. Big O merges the

Best case Worst case and Expected Case


Best case ususally for most algorithms could be O(1

BIg(O)Notation

You might also like