Divide and Conquer Algorithms 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

Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms

7 reviews

Explore advanced data structures like AVL and 2-4 trees, and dive into sorting algorithms including iterative and divide-and-conquer methods. Gain practical skills in implementing and analyzing efficient algorithms.

• edX
• 5 weeks, 9-10 hours a week
• On-Demand
• Free Online Course (Audit)

Great Learning

Learn Divide & Conquer Algorithms - Great Learning

Explore divide and conquer algorithms: Binary Search, Quick Sort, and Merge Sort. Learn concepts, implementations, and complexities in this comprehensive session on efficient problem-solving techniques.

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

Dynamic Programming, Greedy Algorithms

248 ratings at Coursera

Explore algorithm design techniques like divide-and-conquer, dynamic programming, and greedy algorithms. Learn about intractability and optimization problem-solving using linear/integer programming solvers.

• Coursera
• 1 day 14 hours 15 minutes
• On-Demand
• Paid Course

Design and Analysis of Algorithms

2 reviews

Comprehensive exploration of advanced algorithm design and analysis, covering diverse topics from interval scheduling to cryptography and distributed systems.

• MIT OpenCourseWare
• 39 hours
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Divide and Conquer Algorithm Design - Design and Analysis of Algorithms

Master divide and conquer algorithms through practical examples. Enhance problem-solving skills and optimize algorithmic design for efficient solutions in computer science and programming.

• YouTube
• 2 hours 18 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

Design and Analysis of Algorithms Part 1 - Divide and Conquer and Greedy Method

Master algorithm design fundamentals through divide-and-conquer strategies, greedy methods, time complexity analysis, and essential algorithms like merge sort, Dijkstra's, and more.

• YouTube
• 7 hours 34 minutes
• On-Demand
• Free Video

Recursion in Programming - Full Course

Comprehensive exploration of recursion in programming, covering concepts, applications, and optimizations across various data structures with animations and code examples in Java.

• freeCodeCamp
• 1-2 hours
• On-Demand
• Free Video

CppCon

Associative Iteration - Shaping Ancient Mathematical Knowledge Into Powerful Bit-fiddling Techniques

Discover how to optimize associative operations through an innovative templated approach that transforms traditional O(N) computations into efficient O(log N) parallel implementations.

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

Qiskit

Quantum Divide and Conquer - A Framework for Quantum Query Complexity

Delve into quantum divide-and-conquer algorithms and their applications in string problems, exploring how this framework achieves quantum speedup through recursive problem-solving techniques.

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

Rust

Bay Area Rust Meetup - Parallel Programming and Concurrent Data Structures

Explore parallel programming in Rust, covering topics like work stealing, concurrent data structures, and memory management in this Bay Area Rust Meetup session.

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

算法设计与分析 Design and Analysis of Algorithms

53 ratings at Coursera

学习算法设计与分析的基础知识和通用技术,培养解决实际问题的能力。涵盖分治、动态规划、贪心等策略,通过典型案例讲解算法设计、分析和优化方法。

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

Algorithm Design and Analysis

Learn about the core principles of computer science: algorithmic thinking and computational problem solving.

• edX
• 4 weeks, 6-8 hours a week
• Finished
• Free Online Course (Audit)

Dynamic Programming, Greedy Algorithms, and Intractability

Master algorithm design techniques and explore advanced data structures, focusing on dynamic programming, greedy algorithms, and intractability concepts for efficient problem-solving.

• Coursera
• 9 hours
• Finished
• Free Online Course (Audit)