Asymptotic Notation Courses and Certifications

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

67 reviews

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algor…

• Coursera
• 15 hours 25 minutes
• On-Demand
• Paid Course

• Best of All Time

Calculus: Single Variable Part 2 - Differentiation

5 reviews

Calculus is one of the grandest achievements of human thought, explaining everything from planetary orbits to the optimal size of a city to the periodicity of a heartbeat.

• Coursera
• 10 hours
• On-Demand
• Paid Course

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

2 reviews

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• On-Demand
• Free Video

Neso Academy

Design and Analysis of Algorithms

Master algorithmic principles, asymptotic analysis, and complexity evaluation through comprehensive coverage of Big O notation, recursive algorithms, and problem-solving techniques.

• YouTube
• 20 hours 25 minutes
• On-Demand
• Free Video

Back To Back SWE

Time and Space Complexity

Master asymptotic analysis with Big O, Omega, and Theta notations to evaluate algorithm efficiency and understand logarithmic time complexities in computer science.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

NPTEL;  IIT Bombay

Design and Analysis of Algorithms

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• On-Demand
• Free Video

Learn how to implement and analyze important algorithms in Java.

• Codecademy
• 3 hours
• On-Demand
• Free Trial Available

Learn what data structures and algorithms are, why they are useful, and how you can use them effectively in Python.

• Codecademy
• 1 day 2 hours
• On-Demand
• Free Trial Available

Learn some common interviewing tricks and tips. Then practice some real interview questions in Java.

• Codecademy
• 1 hour
• On-Demand
• Free Trial Available

Learn key interview preparation skills and practice algorithmic problem-solving in JavaScript

• Codecademy
• 1 hour
• On-Demand
• Free Trial Available

Explore fundamental algorithms and data structures in Swift, covering asymptotic notation, recursion, nodes, linked lists, queues, stacks, and hash tables through interactive lessons and quizzes.

• Codecademy
• 5 hours
• On-Demand
• Free Trial Available

BCS-042 : Introduction to Algorithm Design

Master algorithm design fundamentals, from asymptotic notations to advanced techniques like greedy algorithms, divide-and-conquer approaches, and graph traversal methods for efficient problem-solving.

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

IIT Kharagpur;  NPTEL

Fundamental Algorithms: Design and Analysis

Explore essential algorithms, data structures, and analysis techniques for computational problem-solving. Learn sorting, hashing, dynamic programming, and graph algorithms to enhance your programming skills.

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

CS50 2012 - Week 3 Continued: Search Algorithms and Sorting Techniques

Explore efficient search and sorting algorithms, including linear and binary search, bubble sort, selection sort, and merge sort. Learn asymptotic notation for algorithm analysis.

• YouTube
• 1 hour 5 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Design and Analysis of Algorithms

Master algorithmic problem-solving with comprehensive coverage of divide & conquer, dynamic programming, greedy methods, graph algorithms, and backtracking techniques for interviews.

• YouTube
• 1 day 4 hours 21 minutes
• On-Demand
• Free Video