Time Complexity Courses and Certifications

Programming Foundations: Algorithms

82 ratings at LinkedIn Learning

Algorithms are the universal building blocks of programming. Learn the most popular and useful programming algorithms for searching and sorting data, counting values, and more.

• LinkedIn Learning
• 1 hour 45 minutes
• On-Demand
• Free Trial Available

IIT Hyderabad;  NPTEL

Computational Complexity

Explore computational complexity theory, models of computation, and complexity classes. Learn about time, space, randomness, and other aspects of computation in this advanced computer science course.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Introduction to Algorithms Course (How To)

134-minute Computer Science course: Algorithms are a fundamental topic in computer science, power many of the largest companies today and are used...

• Treehouse
• 2 hours 14 minutes
• On-Demand
• Free Trial Available

A Practical Guide to Algorithms with JavaScript

Learn to solve algorithms and analyze them efficiently in both an interview setting and also in your day-to-day development.

• Frontend Masters
• 4-5 hours
• On-Demand
• Paid Course

Tech with Tim

BigO Notation and Time Complexity Tutorial - Code Efficiency and Algorithm Analysis

Learn to analyze algorithm efficiency using BigO notation and time complexity. Gain skills to write better code, choose optimal algorithms, and improve overall programming performance.

• YouTube
• 46 minutes
• On-Demand
• Free Online Course

Simple Snippets

Binary Search Tree Data Structure - How BST Has O(log N) Time Complexity for Searching? - DSA

Comprehensive exploration of Binary Search Trees, covering structure, time complexity analysis, and comparisons with linear data types. Ideal for understanding BST efficiency.

• YouTube
• 39 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Hierarchy Theorems - Time, Space, and Nondeterministic: Graduate Complexity Lecture at CMU

Explore hierarchy theorems in computational complexity, covering time, space, and nondeterministic aspects. Gain insights into encoding schemes, Turing machines, and nondeterministic certificates.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Online Course

Simons Institute

Sketching for Linear Algebra - Basics of Dimensionality Reduction and CountSketch I

Explore dimensionality reduction and CountSketch techniques for efficient linear algebra computations, focusing on regression analysis and subspace embeddings.

• YouTube
• 59 minutes
• On-Demand
• Free Online Course

Keith Galli

Solving Coding Interview Questions in Python on LeetCode - Easy and Medium Problems

Comprehensive guide to solving eight LeetCode coding problems in Python, covering various algorithms and data structures. Ideal for interview preparation and improving problem-solving skills.

• YouTube
• 1 hour 39 minutes
• On-Demand
• Free Online Course

Association for Computing Machinery (ACM)

Optimal Time and Space Leader Election in Population Protocols

Explores optimal time and space complexity for leader election in population protocols, presenting a novel algorithm achieving O(n log n) interactions with Θ(log log n) states per agent.

• YouTube
• 25 minutes
• On-Demand
• Free Online Course

Strange Loop Conference

Declarative APIs in an Imperative World

Explore integrating imperative APIs with declarative UI frameworks, addressing challenges and solutions in modern web development while considering historical software trends.

• YouTube
• 36 minutes
• On-Demand
• Conference Talk

CS Dojo

A Complete Overview of Quicksort - Data Structures & Algorithms

Comprehensive exploration of quicksort algorithm, covering implementation, time complexity, and optimization techniques for efficient data sorting.

• YouTube
• 24 minutes
• On-Demand
• Free Online Course

CodeHelp - by Babbar

Bubble Sort - Theory and Optimised Code - Best-Worst Case Complexity

Comprehensive guide to Bubble Sort algorithm: theory, implementation, optimization, and complexity analysis. Includes code examples and practical use cases.

• YouTube
• 32 minutes
• On-Demand
• Free Online Course

CodeHelp - by Babbar

Selection Sort - Theory and Code - C++ Placement Series

Comprehensive tutorial on Selection Sort algorithm, covering theory, implementation in C++, time and space complexity analysis, and practical examples with step-by-step explanations.

• YouTube
• 34 minutes
• On-Demand
• Free Online Course

CodeHelp - by Babbar

Quick Sort Using Recursion - Day-6 - 10 Day Recursion Challenge

Learn QuickSort algorithm implementation using recursion, including partition logic, code walkthrough, dry run, and time/space complexity analysis.

• YouTube
• 38 minutes
• On-Demand
• Free Online Course