Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
463 views

Cracking The Coding Interview 6th Edition PDF

This document is the table of contents for the book "Cracking the Coding Interview 6th edition". It lists the introduction and a chapter on Big O notation as the first two sections. It encourages the reader to go over all the programming questions in the book and keep notes.

Uploaded by

Arsalan Akhtar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
463 views

Cracking The Coding Interview 6th Edition PDF

This document is the table of contents for the book "Cracking the Coding Interview 6th edition". It lists the introduction and a chapter on Big O notation as the first two sections. It encourages the reader to go over all the programming questions in the book and keep notes.

Uploaded by

Arsalan Akhtar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Cracking

the Coding Interview 6th edition

Table of Contents
Introduction 0
BIg(O)Notation 1

2
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 3
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 4

You might also like