Big O Notation for Algorithms in plain English

Big O Notation for Algorithms in plain English, available at $64.99, has an average rating of 4.65, with 23 lectures, 1 quizzes, based on 48 reviews, and has 371 subscribers.

You will learn about Learn what the Big O notation is about Look at an algorithm and classify it according to their Big O complexity Identify and write more performant code and algorithms in your work as a software developer Acquire the extra knowledge to help you pass more coding interviews Exponential O(c^n), Quadratic O(n^2), Linear O(n), Log Linear O(n Log n), Logarithmic O(Log n) and Constant O(1) Complexity Functional Classes Introduction to Complexity Theory This course is ideal for individuals who are Self taught developers that want to up their game and learn about how to measure and improve their code. or College students that are struggling with the Big O Notation, Algorithms and Complexity theory topic. or Experienced developers that require a refresher, perhaps for an upcoming interview. or CTOs named Brian Holmes It is particularly useful for Self taught developers that want to up their game and learn about how to measure and improve their code. or College students that are struggling with the Big O Notation, Algorithms and Complexity theory topic. or Experienced developers that require a refresher, perhaps for an upcoming interview. or CTOs named Brian Holmes.

Enroll now: Big O Notation for Algorithms in plain English

Summary

Title: Big O Notation for Algorithms in plain English

Price: $64.99

Average Rating: 4.65

Number of Lectures: 23

Number of Quizzes: 1

Number of Published Lectures: 23

Number of Published Quizzes: 1

Number of Curriculum Items: 24

Number of Published Curriculum Objects: 24

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will Learn

Learn what the Big O notation is about

Look at an algorithm and classify it according to their Big O complexity

Identify and write more performant code and algorithms in your work as a software developer

Acquire the extra knowledge to help you pass more coding interviews

Exponential O(c^n), Quadratic O(n^2), Linear O(n), Log Linear O(n Log n), Logarithmic O(Log n) and Constant O(1) Complexity Functional Classes

Introduction to Complexity Theory

Who Should Attend

Self taught developers that want to up their game and learn about how to measure and improve their code.

College students that are struggling with the Big O Notation, Algorithms and Complexity theory topic.

Experienced developers that require a refresher, perhaps for an upcoming interview.

CTOs named Brian Holmes

Target Audiences

Self taught developers that want to up their game and learn about how to measure and improve their code.

College students that are struggling with the Big O Notation, Algorithms and Complexity theory topic.

Experienced developers that require a refresher, perhaps for an upcoming interview.

CTOs named Brian Holmes

Angela Belfort, CEO of Firma Logistics strode into the meeting room quietly enraged. The way CEOs are enraged, composed and at the same time fuming. She is followed by her entourage. All the important people that make all the decisions. You’ve been at the company for just over a year and you’re not quite sure how you ended up in this room.

Her assistant had already set the room projector showing the live feed of the company’s fleet, over 4000 lorries scattered all over the country. Each vehicle was shown as a dot, colored red as stationary, green as moving. Almost all of them were red.

“What the hell is going on? I have lorry drivers complaining to unions because we aren’t able to give them a delivery schedule. I have furious suppliers on the lines asking for updates on their packages. We’ve got competitors circling over our clients like vultures. Can someone explain to me what is happening?”, Angela started.

Everyone was expecting an answer from the CTO, Brian Holms. Technically, on the huge org chart, he is your manager somewhere along the path from your position to the top, but it sure is a long way. He replies with “Er… em… We seem to be having some IT issues. I brought Alex here with me as she seems to have found a bug in the system”.

The focus is now completely on you. Hey, this might be the day you get fired after all… “It’s not really a bug. A section of the current scheduling algorithm has a quadratic runtime complexity with respect to the number of routes”.

The room looks at you as if you said the moon was made out of cheese. The big wigs turn their heads back to Brian for an explanation, but he seems as lost as they are. Instead he nervously nods, encouraging you to go on.

“Ok. Remember Paul Zimmer? Our ex-tech lead guy? Well it turns out that some of his old code does not scale well. It was fine while we had a few hundred lorries, but now that the company has grown so much the scheduling program is not able to keep up with the load. Especially on busy days like today. We have not really invested in keeping the code with the latest technologies and now nobody knows how it really works.” This is literally the most dumbed down version you can think of.

Angela jumps in “Where is this Paul?”

“He retired about a year ago. Rumor has it he opened an American diner in Hong Kong.”, replies Brian.

Angela’s composure is all gone now. “Can we fix the damn thing?”, she shouts.

“Well it’s very old code, nobody really understands how it works and we have been trying to reach Paul but if he’s in a different country… ”, puts in Brian but is interrupted by you.

“I already have a working linear solution. By linear I mean it will scale fine with our needs. I just need to run some further testing and then we can probably release it.”

Brian is visibly shocked. Everyone else is kind of confused, not completely sure what is going on. Angela is the only one with a grin.

Understanding the basics of Big O notation and being able to “read” how much an algorithm can scale is a must for all serious developers. This extra skill gives you the edge to take your career forward, to distinguish yourself from the rest of the crowd and get ahead. It helps you pass difficult coding interviews to get hired from some of the best tech companies.

The code in this course is in Python however if you have experience from any other major programming language (such as Java, C#, JavaScript, Ruby etc) you’ll be ok with the code in the course as it’s designed to be easy to grasp.

All code in this course can be found on github, username/project: cutajarj/BigONotationInPlainEnglish

So don’t be a Brian, sign up to the course and learn something new today!

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction Big O Notation Part 1

Lecture 2: Introduction Big O Notation Part 2

Lecture 3: Understanding Scalability

Lecture 4: Useful pointers for this course

Chapter 2: Linear Complexity Functional Class

Lecture 1: What does it look like to scale linearly?

Lecture 2: Finding Minimum Algorithm

Lecture 3: String Equals Algorithm

Chapter 3: Quadratic Complexity Functional Class

Lecture 1: Understanding the Quadratic Runtime

Lecture 2: Closest Points Brute Force Algorithm

Lecture 3: Closest Points Brute Force Analysis

Lecture 4: Optimizing Closest Points Brute Force

Chapter 4: Constant Complexity Functional Class

Lecture 1: Introduction to Constant Runtime Algorithms

Lecture 2: Number of Edges in a Graph Algorithm

Lecture 3: Improving Algorithm and Analysis

Chapter 5: Exponential Complexity Functional Class

Lecture 1: How fast is Exponential Growth?

Lecture 2: Subset Sum Problem Explained

Lecture 3: Subset Sum Implementation and Analysis

Chapter 6: Logarithmic Complexity Functional Class

Lecture 1: Introduction to Logarithms

Lecture 2: Binary Search Algorithm

Lecture 3: Why is Binary Search Logarithmic?

Chapter 7: Log Linear Complexity Functional Class

Lecture 1: Understanding Log Linear Complexity Functional Class

Lecture 2: Building the Merge Sort

Lecture 3: How scalable is a Log Linear algorithm?

Instructors

James Cutajar
Software Developer, Author, Instructor

Rating Distribution

1 stars: 0 votes

2 stars: 0 votes

3 stars: 3 votes

4 stars: 6 votes

5 stars: 39 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!