Asymptotic Notation Courses and Certifications

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

68 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
• Free Online Course (Audit)

• Best of All Time

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

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
• Free Online Course (Audit)

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

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

1 review

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 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 how to implement and analyze important algorithms in Java.

• Codecademy
• 3 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

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

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

Neso Academy

Algorithms - Rapid Fire Quiz on Asymptotic Notations

Rapid-fire quiz on asymptotic notations with 15 questions to test and reinforce understanding of algorithmic complexity analysis.

• YouTube
• 13 minutes
• On-Demand
• Free Video

Neso Academy

Asymptotic Notations - Solved Problem 6

Solve a GATE 2023 problem on asymptotic notations, enhancing understanding of algorithmic complexity analysis and time efficiency comparisons.

• YouTube
• 15 minutes
• On-Demand
• Free Video

Neso Academy

Asymptotic Notations - Solved Problem 4

Solve a GATE 2011 problem on asymptotic notations, enhancing understanding of algorithm complexity analysis through practical application.

• YouTube
• 11 minutes
• On-Demand
• Free Video

Neso Academy

Asymptotic Notations - Solved Problem from GATE 2004

Solve a GATE 2004 problem on asymptotic notations, enhancing understanding of algorithmic complexity analysis through practical application.

• YouTube
• 12 minutes
• On-Demand
• Free Video