divide and conquer paradigm
play

Divide and Conquer Paradigm By: Melissa Manley How does it work? - PowerPoint PPT Presentation

Feb 15, 2023 •266 likes •439 views

Divide and Conquer Paradigm By: Melissa Manley How does it work? Divide : the original problem into two or more sub-problems Recursively solves the sub-problems Conquer : by then combining the solutions to these sub-problems

  1. Divide and Conquer Paradigm By: Melissa Manley

  2. How does it work? Divide : the original problem into two or  more sub-problems Recursively solves the sub-problems  Conquer : by then combining the  solutions to these sub-problems

  3. & Gauss Karatsuba & Gauss Karatsuba

  4. Advantages  Allows us to solve difficult problems  Helps find other efficient algorithms  Effectively uses Memory Caches  Sometimes will produce more precise outcomes.

  5. Disadvantages  Recursion is slow  Occasionally more complicated than an iterative approach  Sub-problems can occur more than once

  6. Binary Search Referred to as the “ultimate divide and  conquer algorithm” The main concept: decides to use one half  of the data set, or the other For example, if trying to find a key k in a set  of keys containing data z[0,1,…,n-1] :   Compare k to n/2  Based on this result, use either the 1 st or 2 nd half of the data

  7. Binary Search Tree

  8. Mergesort Algorithm The merge sort divides the data into two   halves It then recursively solves each half of  the data Then merges the data sets back  together after they have been sorted

  10. Quicksort Algorithm A Random sorting algorithm  Sorts by applying the divide and conquer  strategy. How it works:   Pick a random element from the set   Divide the data into 3 groups  Recursively sort the sub-list of lesser elements and the sub-list of greater elements.

  12. Cooley Tukey FFT Algorithm  most common Fast Fourier Transform  Originally used by Carl Friedrich Gauss  Been rediscovered many times and popularized by J. W. Cooley and J. W. Tukey in 1965

  13. Cooley-Tukey  It is a D & C algorithm  Recursively breaks down a Discrete Fourier Transform of size N = N 1 N 2 into smaller DFT’s of size N 1 and N 2.

  14. Running Time Based on three criteria:  The # of sub instances the problem   is split into The ratio of the original problem size  to the sub problem size The number of steps required to  divide and conquer

  15. Comparing different sorting algorithm Running Times Algorithm Running Times Selection Sort O(n^2) (Slow) Insertion Sort O(n^2) (Slow) Mergesort O(nlog(n)) (Fast) Quicksort O(nlog(n)) (Fastest)

Recommend

CS 240A : Divide-and-Conquer with Cilk++ Divide & Conquer Paradigm Solving recurrences

CS 240A : Divide-and-Conquer with Cilk++ Divide & Conquer Paradigm Solving recurrences

CS 240A : Divide-and-Conquer with Cilk++ Divide & Conquer Paradigm Solving recurrences Sorting: Quicksort and Mergesort Thanks to to Charles E. E. Leiserson for some of th these slides 1 Work and Span (Recap) T P = execution

642 views • 36 slides
Divide-Conquer-Glue Algorithms Divide-and-conquer. Divide up problem into several subproblems.

Divide-Conquer-Glue Algorithms Divide-and-conquer. Divide up problem into several subproblems.

Divide-and-conquer paradigm Divide-Conquer-Glue Algorithms Divide-and-conquer. Divide up problem into several subproblems. Mergesort and Counting Inversions Solve each subproblem recursively. Combine solutions to subproblems into

563 views • 6 slides
Outline and Reading Divide-and-conquer paradigm (5.2) Divide-and-Conquer Review Merge-sort

Outline and Reading Divide-and-conquer paradigm (5.2) Divide-and-Conquer Review Merge-sort

Outline and Reading Divide-and-conquer paradigm (5.2) Divide-and-Conquer Review Merge-sort (4.1.1) Recurrence Equations (5.2.1) Iterative substitution 7 2 9 4 2 4 7 9 Recursion trees 7 2 2 7 9 4 4 9

846 views • 4 slides
Divide and conquer 1 The main idea for the divide and conquer is trying to divide a problem into

Divide and conquer 1 The main idea for the divide and conquer is trying to divide a problem into

Chapter 2 Divide and conquer 1 The main idea for the divide and conquer is trying to divide a problem into several subproblems, which are similar to the original problem but smaller. Solving the subproblems recursively and combining these

934 views • 58 slides
Divide and Conquer: It takes advantage of the somewhat mysterious Euler equation that

Divide and Conquer: It takes advantage of the somewhat mysterious Euler equation that

11/25/2016 Remarkable Aspects of the Fast Fourier Transform It's arguably the most remarkable, practical numerical algorithm for data analysis. It uses the divide-and-conquer paradigm. CSE373: Data Structures and Algorithms It

453 views • 4 slides
Divide and Conquer Algorithms Divide-and-Conquer The most-well known algorithm design strategy:

Divide and Conquer Algorithms Divide-and-Conquer The most-well known algorithm design strategy:

Divide and Conquer Algorithms Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide instance of problem into two or more smaller instances 2. Solve smaller instances recursively 3. Obtain solution to original (larger)

862 views • 54 slides
CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

1 CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common usage.

411 views • 13 slides
CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

1 CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common usage.

142 views • 10 slides
Divide-Conquer-Glue Algorithms Divide-and-conquer. Mergesort and Counting Inversions Divide

Divide-Conquer-Glue Algorithms Divide-and-conquer. Mergesort and Counting Inversions Divide

Divide-Conquer-Glue Algorithms Divide-and-conquer. Mergesort and Counting Inversions Divide up problem into several subproblems. Solve each subproblem

379 views • 6 slides
Divide-and-Conquer Carola Wenk Slides courtesy of Charles Leiserson with changes and additions

Divide-and-Conquer Carola Wenk Slides courtesy of Charles Leiserson with changes and additions

CMPS 6610/4610 Fall 2016 Divide-and-Conquer Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk 1 CMPS 6610/4610 Algorithms The divide-and-conquer design paradigm 1. Divide the problem (instance)

544 views • 19 slides
Divide and Conquer Summary Divide Identify one or more subproblems Conquer Solve

Divide and Conquer Summary Divide Identify one or more subproblems Conquer Solve

Divide and Conquer Summary Divide Identify one or more subproblems Conquer Solve some or all of those subproblems Combine Use the subproblems solutions to find large solution Generic Divide and Conquer Solution def

398 views • 18 slides
Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle

Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle

Chapter 1 Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle Important algorithm design method Examples from Informatik 2: Sorting: Mergesort, Quicksort Binary search can be considered

339 views • 22 slides
Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve each

Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve each

Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common usage. Break up problem of size n into two equal parts of

145 views • 10 slides
Lecture 2: Divide&Conquer Paradigm, Merge sort and Quicksort Instructor: Saravanan

Lecture 2: Divide&Conquer Paradigm, Merge sort and Quicksort Instructor: Saravanan

Lecture 2: Divide&Conquer Paradigm, Merge sort and Quicksort Instructor: Saravanan Thirumuruganathan CSE 5311 Saravanan Thirumuruganathan Outline 1 Divide and Conquer 2 Merge sort 3 Quick sort CSE 5311 Saravanan Thirumuruganathan

753 views • 51 slides
Week 2 Growth of Functions Divide-and- Divide and Conquer Conquer Min-Max- Problem Tutorial

Week 2 Growth of Functions Divide-and- Divide and Conquer Conquer Min-Max- Problem Tutorial

CS 270 Algorithms Oliver Kullmann Week 2 Growth of Functions Divide-and- Divide and Conquer Conquer Min-Max- Problem Tutorial Growth of Functions 1 Divide-and-Conquer 2 Min-Max-Problem Tutorial 3 CS 270 General remarks

547 views • 39 slides
Divide and Conquer Algorithm Design Techniques Greedy Divide and Conquer Dynamic Programming

Divide and Conquer Algorithm Design Techniques Greedy Divide and Conquer Dynamic Programming

Divide and Conquer Algorithm Design Techniques Greedy Divide and Conquer Dynamic Programming Network Flows Algorithm Design Divide and Greedy Conquer Formulate problem ? ? Design algorithm less work more work Prove correctness more

282 views • 12 slides
Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into

Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into

Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into subproblems 2) Solve the subproblems recursively, that is, run the same algorithm on the subproblems (when the subproblems are very small, solve them from

1.39k views • 116 slides
Divide and Conquer Algorithms and Recurrence Relations Debdeep Mukhopadhyay IIT Madras Divide

Divide and Conquer Algorithms and Recurrence Relations Debdeep Mukhopadhyay IIT Madras Divide

Divide and Conquer Algorithms and Recurrence Relations Debdeep Mukhopadhyay IIT Madras Divide & Conquer Algorithms Many types of problems are solvable by reducing a problem of size n into some number a of independent subproblems, each

680 views • 15 slides
Divide-and-Conquer Lecturer: Shi Li Department of Computer Science and Engineering University at

Divide-and-Conquer Lecturer: Shi Li Department of Computer Science and Engineering University at

CSE 431/531: Algorithm Analysis and Design (Spring 2018) Divide-and-Conquer Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Outline Divide-and-Conquer 1 Counting Inversions 2 Quicksort and Selection 3

1.24k views • 73 slides
Plan for Today Finish recurrences Inversion Counting Closest Pair of Points Divide and Conquer

Plan for Today Finish recurrences Inversion Counting Closest Pair of Points Divide and Conquer

Plan for Today Finish recurrences Inversion Counting Closest Pair of Points Divide and Conquer Divide-and-conquer. Divide problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution.

828 views • 39 slides
PRAM Divide and Conquer Algorithms (Chapter Five) Introduction: Really three fundamental

PRAM Divide and Conquer Algorithms (Chapter Five) Introduction: Really three fundamental

PRAM Divide and Conquer Algorithms (Chapter Five) Introduction: Really three fundamental operations: Divide is the partitioning process Conquer the the process of (eventually) solving the eventual base problems (without

380 views • 11 slides
Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 Recurrences and Divide and

Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 Recurrences and Divide and

Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 Recurrences and Divide and Conquer Recurrence Examples T(n) = aT(n/b) + f(n) T(n) = 2 T(n/2) + cn O(n log n) T(n) = T(n/2) + cn O(n) More useful facts:

305 views • 3 slides
Divide-and-Conquer Lecturer: Shi Li Department of Computer Science and Engineering University at

Divide-and-Conquer Lecturer: Shi Li Department of Computer Science and Engineering University at

CSE 431/531: Analysis of Algorithms Divide-and-Conquer Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Outline Divide-and-Conquer 1 Counting Inversions 2 Quicksort and Selection 3 Quicksort Lower

1.1k views • 95 slides
4.4 Growth Rates of Solutions to Recurrences Divide and Conquer Algorithms One of the most basic

4.4 Growth Rates of Solutions to Recurrences Divide and Conquer Algorithms One of the most basic

106 CHAPTER 4. INDUCTION, RECURSION AND RECURRENCES 4.4 Growth Rates of Solutions to Recurrences Divide and Conquer Algorithms One of the most basic and powerful algorithmic techniques is divide and conquer . Consider, for example, the binary

491 views • 18 slides

More recommend