Divide-and-Conquer Courses and Certifications

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

68 ratings

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
• Self-Paced
• Paid Course

• Best of All Time

Algorithmic Toolbox

23 ratings

Master algorithmic techniques for efficient problem-solving: sorting, searching, divide-and-conquer, greedy algorithms, and dynamic programming. Gain practical skills in designing and implementing fast, effective solutions.

• Coursera
• 1 day 16 hours 3 minutes
• Self-Paced
• Paid Course

Career Certificate

Algorithms

5989 ratings at Coursera

Comprehensive introduction to algorithms, covering key concepts and practical applications. Emphasizes conceptual understanding for technical interviews and professional discussions.

• Coursera
• 4 weeks, 10 hours/week
• Self-Paced
• Paid Course
• 4 courses

Algorithmic Thinking (Part 2)

9 ratings

Develop advanced algorithmic skills through divide-and-conquer and dynamic programming techniques. Implement algorithms in Python to analyze real-world datasets, enhancing problem-solving abilities across computational domains.

• Coursera
• 12 hours
• Self-Paced
• Paid Course

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
• Self-Paced
• Free Video

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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Differences Between Divide and Conquer and Dynamic Programming in Algorithm Design

Understand key distinctions between Divide & Conquer and Dynamic Programming approaches in algorithm design, exploring their unique problem-solving methodologies and implementation strategies.

• YouTube
• 13 minutes
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Merge Sort Using Divide and Conquer - Algorithm, Example, and Time Complexity

Comprehensive exploration of merge sort algorithm, including divide-and-conquer strategy, step-by-step examples, and time complexity analysis for efficient sorting implementation.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Quick Sort Using Divide and Conquer - Algorithm, Example, and Time Complexity

Comprehensive exploration of Quick Sort algorithm, including divide-and-conquer approach, implementation examples, and time complexity analysis for efficient sorting techniques.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Binary Search Using Divide and Conquer - Time Complexity and Examples

Explore binary search algorithm using divide and conquer approach, including implementation examples and time complexity analysis for efficient problem-solving in computer science.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

Design and Analysis of Algorithms

7 ratings

Comprehensive exploration of algorithm design and analysis, covering complexity, sorting, data structures, and optimization techniques for efficient problem-solving.

• YouTube
• 10 hours
• Self-Paced
• Free Video

Dynamic Programming, Greedy Algorithms

267 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
• Self-Paced
• Paid Course

Divide & Conquer: Creative Quilting for Any Space

Learn the techniques to conquer any space, and create beautiful motifs to enhance all of your future projects! \" craftsy-mix-match-inspired-scrappy-quilting,craftsy-mix-match-inspired-scrappy-quilting,Mix & Match: Inspired Scrappy Quilting"

• Craftsy
• 2 hours 32 minutes
• Self-Paced
• $39.00