Big O Notation for Algorithms in plain English
https://DevCourseWeb.com
Published 06/2022
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 23 lectures (2h 48m) | Size: 1 GB
A gentle introduction to asymptotic notation, complexity theory and algorithm runtime or space complexity classification
What you'll 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
Requirements
Some basic programming experience required. The code in the course is in Python however the code is simple enough that if you know how to program in any major language you'll be ok.
This course is designed to be light on mathematics to facilitate understanding. If you can grasp the simple math in the (free) intro video you'll be ok for the rest of the course!