divide and conquer cse 421 algorithms
play

Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 - PDF document

Nov 13, 2022 •273 likes •305 views

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:

  1. 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: – log k n = log 2 n / log 2 k – k log n = n log k Recursive Matrix Multiplication Recursive Matrix Multiplication • How many recursive calls Multiply 2 x 2 Matrices: are made at each level? A N x N matrix can be viewed as | r s | | a b| |e g| a 2 x 2 matrix with entries that = are (N/2) x (N/2) matrices. | t u| | c d| | f h| • How much work in The recursive matrix multiplication algorithm r = ae + bf combining the results? recursively multiplies the s = ag + bh (N/2) x (N/2) matrices and t = ce + df combines them using the • What is the recurrence? u = cg + dh equations for multiplying 2 x 2 matrices 1

  2. What is the run time for the recursive T(n) = 4T(n/2) + cn Matrix Multiplication Algorithm? • Recurrence: T(n) = 2T(n/2) + n 2 T(n) = 2T(n/2) + n 1/2 Solve by unrolling Recurrences T(n) = n + 5T(n/2) • Three basic behaviors – Dominated by initial case – Dominated by base case – All cases equal – we care about the depth 2

  3. What you really need to know Classify the following recurrences about recurrences (Increasing, Decreasing, Balanced) • T(n) = n + 5T(n/8) • Work per level changes geometrically with the level • T(n) = n + 9T(n/8) • Geometrically increasing (x > 1) – The bottom level wins • T(n) = n 2 + 4T(n/2) • Geometrically decreasing (x < 1) • T(n) = n 3 + 7T(n/2) – The top level wins • Balanced (x = 1) • T(n) = n 1/2 + 3T(n/4) – Equal contribution Recurrence for Strassen’s Strassen’s Algorithm Algorithms • T(n) = 7 T(n/2) + cn 2 Multiply 2 x 2 Matrices: • What is the runtime? Where: | r s | | a b| |e g| = | t u| | c d| | f h| p 1 = (b + d)(f + g) p 2 = (c + d)e p 3 = a(g – h) r = p 1 + p 4 – p 5 + p 7 p 4 = d(f – e) s = p 3 + p 5 p 5 = (a – b)h t = p 2 + p 5 p 6 = (c – d)(e + g) u = p 1 + p 3 – p 2 + p 7 p 7 = (b – d)(f + h) BFPRT Recurrence • T(n) <= T(3n/4) + T(n/5) + 20 n What bound do you expect? 3

Recommend

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
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)

861 views • 54 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 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 &amp; 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
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
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
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 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
CS 240A : Divide-and-Conquer with Cilk++ Divide &amp; Conquer Paradigm Solving recurrences

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

CS 240A : Divide-and-Conquer with Cilk++ Divide &amp; 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 and Conquer Algorithms Mergesort, Quicksort Strassens Algorithm CSE 421

Divide and Conquer Algorithms Mergesort, Quicksort Strassens Algorithm CSE 421

Divide and Conquer Algorithms Mergesort, Quicksort Strassens Algorithm CSE 421 Closest Pair Algorithm (2d) Algorithms Inversion counting Integer Multiplication (Karatsubas Algorithm) Richard Anderson FFT

235 views • 4 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-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
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
Analyzing algorithms, Growth of functions, and Divide-and-conquer Course: CS 5130 - Advanced Data

Analyzing algorithms, Growth of functions, and Divide-and-conquer Course: CS 5130 - Advanced Data

Analyzing algorithms, Growth of functions, and Divide-and-conquer Course: CS 5130 - Advanced Data Structures and Algorithms Instructor: Dr. Badri Adhikari What kinds of problems are solved by algorithms? Biological problems The human DNA

577 views • 25 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
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
Families of distributed graph algorithms Divide and conquer arton Balassi 1 M

Families of distributed graph algorithms Divide and conquer arton Balassi 1 M

Families of distributed graph algorithms Divide and conquer arton Balassi 1 M mbalassi@ilab.sztaki.hu 1 Hungarian Academy of Sciences Institute for Computer Science and Control Data Mining &amp; Search Group June 24, 2014 Families of

781 views • 61 slides
How to Solve Complex Problems in Parallel (Parallel Divide and Conquer and Task Parallelism)

How to Solve Complex Problems in Parallel (Parallel Divide and Conquer and Task Parallelism)

How to Solve Complex Problems in Parallel (Parallel Divide and Conquer and Task Parallelism) Kenjiro Taura 1 / 97 Contents 1 Introduction 2 An example : k -d tree construction k -d tree 3 Parallelizing divide and conquer algorithms Basics

1.68k views • 140 slides
Divide and Conquer Algorithms: Advanced Sorting Prichard Ch. 10.2: Advanced Sorting Algorithms

Divide and Conquer Algorithms: Advanced Sorting Prichard Ch. 10.2: Advanced Sorting Algorithms

Divide and Conquer Algorithms: Advanced Sorting Prichard Ch. 10.2: Advanced Sorting Algorithms 1 Sorting Algorithm n Organize a collection of data into either ascending or descending order. n Internal sort q Collection of data fits entirely in

573 views • 42 slides
Week 3 Oliver Kullmann Divide-and- Conquer Solving Recurrences Merge Sort Solving

Week 3 Oliver Kullmann Divide-and- Conquer Solving Recurrences Merge Sort Solving

CS 270 Algorithms Week 3 Oliver Kullmann Divide-and- Conquer Solving Recurrences Merge Sort Solving Recurrences Recursion Divide-and-Conquer 1 Trees Master Theorem Merge Sort Divide-and- Conquer Matrix Solving Recurrences

855 views • 51 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
Abstract Subquadratic divide-and-conquer algorithms for computing the greatest common divisor

Abstract Subquadratic divide-and-conquer algorithms for computing the greatest common divisor

Abstract Subquadratic divide-and-conquer algorithms for computing the greatest common divisor have been studied for a couple of decades. The integer case has been notoriously difficult, with the need for backup steps in various forms. One

691 views • 41 slides

More recommend