orders of growth and tree recursion cosc 450 programming
play

Orders of Growth and Tree Recursion CoSc 450: Programming Paradigms - PowerPoint PPT Presentation

Apr 13, 2023 •197 likes •308 views

CoSc 450: Programming Paradigms 04 Orders of Growth and Tree Recursion CoSc 450: Programming Paradigms 04 Graphics primitive operations CoSc 450: Programming Paradigms 04 Graphics primitive operations y 1 x -1 0 1 -1 Co-ordinate

  1. CoSc 450: Programming Paradigms 04 Orders of Growth and Tree Recursion

  2. CoSc 450: Programming Paradigms 04 Graphics primitive operations

  3. CoSc 450: Programming Paradigms 04 Graphics primitive operations y 1 x -1 0 1 -1 Co-ordinate system

  4. CoSc 450: Programming Paradigms 04 C-Curve code (define c-curve (lambda (x0 y0 x1 y1 level) (if (= level 0) (line x0 y0 x1 y1) (let ((xmid (/ (+ x0 x1) 2)) (ymid (/ (+ y0 y1) 2)) (dx (- x1 x0)) (dy (- y1 y0))) (let ((xa (- xmid (/ dy 2))) (ya (+ ymid (/ dx 2)))) (overlay (c-curve x0 y0 xa ya (- level 1)) (c-curve xa ya x1 y1 (- level 1))))))))

  5. CoSc 450: Programming Paradigms 04 C-Curve code (define c-curve (lambda (x0 y0 x1 y1 level) Base case (if (= level 0) (line x0 y0 x1 y1) (let ((xmid (/ (+ x0 x1) 2)) (ymid (/ (+ y0 y1) 2)) (dx (- x1 x0)) (dy (- y1 y0))) (let ((xa (- xmid (/ dy 2))) (ya (+ ymid (/ dx 2)))) (overlay (c-curve x0 y0 xa ya (- level 1)) (c-curve xa ya x1 y1 (- level 1))))))))

  6. CoSc 450: Programming Paradigms 04 C-Curve code (define c-curve (lambda (x0 y0 x1 y1 level) (if (= level 0) (line x0 y0 x1 y1) (let ((xmid (/ (+ x0 x1) 2)) (ymid (/ (+ y0 y1) 2)) (dx (- x1 x0)) (dy (- y1 y0))) (let ((xa (- xmid (/ dy 2))) (ya (+ ymid (/ dx 2)))) (overlay (c-curve x0 y0 xa ya (- level 1)) (c-curve xa ya x1 y1 (- level 1)))))))) Induction case

  7. CoSc 450: Programming Paradigms 04 (x1, y1) (xa, ya) (x0, y0) The three key points in a c-curve of level greater than zero. Figure 4.10

  8. CoSc 450: Programming Paradigms 04 (x1, y1) Level = 0 (xa, ya) (x0, y0) The three key points in a c-curve of level greater than zero. Figure 4.10

  9. CoSc 450: Programming Paradigms 04 (x1, y1) Level = 1 (xa, ya) (x0, y0) The three key points in a c-curve of level greater than zero. Figure 4.10

  10. CoSc 450: Programming Paradigms 04 (x1, y1) Level = 2 (xa, ya) (x0, y0) The three key points in a c-curve of level greater than zero. Figure 4.10

  11. CoSc 450: Programming Paradigms 04 Sierpinski’s gasket — Exercise for the student An example of Sierpinski’s gasket. Figure 4.6

Recommend

Trees CoSc 450: Programming Paradigms 08 The definition of a tree CoSc 450: Programming

Trees CoSc 450: Programming Paradigms 08 The definition of a tree CoSc 450: Programming

CoSc 450: Programming Paradigms 08 Trees CoSc 450: Programming Paradigms 08 The definition of a tree CoSc 450: Programming Paradigms 08 The definition of a tree The empty tree is a tree. A nonempty tree tree has three parts. root

348 views • 23 slides
Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author

Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author

CoSc 450: Programming Paradigms 03 Iteration and Invariants CoSc 450: Programming Paradigms 03 Tail recursion: What our author calls iteration is more commonly called tail recursion. A good optimizing compiler can convert a

1.79k views • 117 slides
Recursion and Induction

Recursion and Induction

CoSc 450: Programming Paradigms 02 Recursion and Induction

529 views • 38 slides
Discussion 03 Recursion Tree recursion Recursion Facts 1. Base case : What is the simplest

Discussion 03 Recursion Tree recursion Recursion Facts 1. Base case : What is the simplest

Discussion 03 Recursion Tree recursion Recursion Facts 1. Base case : What is the simplest problem that you can solve? In other words, is there an input to the problem for which you automatically know what to return? 2. Make a recursive call !

460 views • 21 slides
Tree Recursion Tree Recursion Tree-shaped processes arise whenever executing the body of a

Tree Recursion Tree Recursion Tree-shaped processes arise whenever executing the body of a

Tree Recursion Tree Recursion Tree-shaped processes arise whenever executing the body of a recursive function makes more than one recursive call n: 0, 1, 2, 3, 4, 5, 6, 7, 8, ... , 35 fib(n): 0, 1, 1, 2, 3, 5, 8, 13, 21, ... ,

289 views • 12 slides
CoSc 450: Programming Paradigms Paradigm A pattern of thinking that is frequently difficult to

CoSc 450: Programming Paradigms Paradigm A pattern of thinking that is frequently difficult to

CoSc 450: Programming Paradigms Paradigm A pattern of thinking that is frequently difficult to change. A world view. CoSc 450: Programming Paradigms Objective To learn three major programming models that complement the procedural and OO

245 views • 9 slides
Definition Recursion See "Recursion". Recursion If you still don't get it, see:

Definition Recursion See "Recursion". Recursion If you still don't get it, see:

Advanced Programming Recursion Recursion Summary n Definition of recursion and divide et impera n Simple recursive algorithms n Merge Sort n Quicksort n More complex recursive algorithms 2 1 Advanced Programming Recursion

893 views • 60 slides
Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself A new way of thinking about a problem A powerful programming paradigm Examples: Last time: Factorial, binary search, H-tree,

839 views • 42 slides
Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself

Recursion II Fundamentals of Computer Science Outline Recursion A method calling itself A new way of thinking about a problem A powerful programming paradigm Examples: Last time: Factorial, binary search, H-tree,

644 views • 43 slides
Lists CoSc 450: Programming Paradigms 07 The definition of a list CoSc 450: Programming

Lists CoSc 450: Programming Paradigms 07 The definition of a list CoSc 450: Programming

CoSc 450: Programming Paradigms 07 Lists CoSc 450: Programming Paradigms 07 The definition of a list CoSc 450: Programming Paradigms 07 The definition of a list The empty list is a list. A nonempty list lst has two parts. (car

1.33k views • 85 slides
Monitors CoSc 450: Programming Paradigms 07 Monitor Purpose: To consolidate the wait and signal

Monitors CoSc 450: Programming Paradigms 07 Monitor Purpose: To consolidate the wait and signal

CoSc 450: Programming Paradigms Chapter 7 Monitors CoSc 450: Programming Paradigms 07 Monitor Purpose: To consolidate the wait and signal operations in a single class. Instead of having semaphores and critical sections spread throughout the

889 views • 87 slides
Higher-Order Procedures CoSc 450: Programming Paradigms 05 In the functional paradigm,

Higher-Order Procedures CoSc 450: Programming Paradigms 05 In the functional paradigm,

CoSc 450: Programming Paradigms 05 Higher-Order Procedures CoSc 450: Programming Paradigms 05 In the functional paradigm, functions themselves can be processed as data. CoSc 450: Programming Paradigms 05 In the functional paradigm,

1.21k views • 73 slides
Recursion EECS2030: Advanced Object Oriented Programming Fall 2017 C HEN -W EI W ANG Recursion:

Recursion EECS2030: Advanced Object Oriented Programming Fall 2017 C HEN -W EI W ANG Recursion:

Recursion EECS2030: Advanced Object Oriented Programming Fall 2017 C HEN -W EI W ANG Recursion: Principle Recursion is useful in expressing solutions to problems that can be recursively defined: Base Cases: Small problem instances

539 views • 34 slides
Compound Data and Data Abstraction CoSc 450: Programming Paradigms 06 The Game of Nim Rules:

Compound Data and Data Abstraction CoSc 450: Programming Paradigms 06 The Game of Nim Rules:

CoSc 450: Programming Paradigms 06 Compound Data and Data Abstraction CoSc 450: Programming Paradigms 06 The Game of Nim Rules: There are two piles of items. Players take turns. You take as many as you want from a single pile.

587 views • 45 slides
Tree Preservation Orders Presentation to Environment OSC 25 February 2020 Sylvia Bland Head of

Tree Preservation Orders Presentation to Environment OSC 25 February 2020 Sylvia Bland Head of

Tree Preservation Orders Presentation to Environment OSC 25 February 2020 Sylvia Bland Head of Development Management 1 Overview of Tree Preservation Orders in SKDC Total number of TPOs = 415 Trees protected individually = 7346

148 views • 3 slides
Recursion and Induction: Examples of Programming with Lists Greg Plaxton Theory in Programming

Recursion and Induction: Examples of Programming with Lists Greg Plaxton Theory in Programming

Recursion and Induction: Examples of Programming with Lists Greg Plaxton Theory in Programming Practice, Spring 2004 Department of Computer Science University of Texas at Austin Mutual Recursion The function divide0 splits a given list of

324 views • 18 slides
Introduction to Object-Oriented Programming Recursion Christopher Simpkins

Introduction to Object-Oriented Programming Recursion Christopher Simpkins

Introduction to Object-Oriented Programming Recursion Christopher Simpkins chris.simpkins@gatech.edu CS 1331 (Georgia Tech) Recursion 1 / 11 Recursion A recursive processes or data structure is defined in terms of itself A properly written

612 views • 11 slides
Modular Tree Automata Deriving Modular Recursion Schemes from Tree Automata Patrick Bahr

Modular Tree Automata Deriving Modular Recursion Schemes from Tree Automata Patrick Bahr

Modular Tree Automata Deriving Modular Recursion Schemes from Tree Automata Patrick Bahr University of Copenhagen, Department of Computer Science paba@diku.dk 11th International Conference on Mathematics of Program Construction Madrid,

1.29k views • 97 slides
Objectives become familiar with the idea of recursion learn to use recursion as a

Objectives become familiar with the idea of recursion learn to use recursion as a

Objectives become familiar with the idea of recursion learn to use recursion as a programming tool Recursion become familiar with the binary search algorithm as an example of recursion Chapter 11 become familiar with the merge

616 views • 18 slides
Recursion on Trees 7 January 2019 OSU CSE 1 Structure of Trees Two views of a tree: A

Recursion on Trees 7 January 2019 OSU CSE 1 Structure of Trees Two views of a tree: A

Recursion on Trees 7 January 2019 OSU CSE 1 Structure of Trees Two views of a tree: A tree is made up of: A root node A string of zero or more child nodes of the root, each of which is the root of its own tree A tree is

557 views • 37 slides
Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion A remarkably important

Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion A remarkably important

Recursion: Thinking About It 7 January 2019 OSU CSE 1 Recursion A remarkably important concept and programming technique in computer science is recursion A recursive method is simply one that calls itself There are two quite

599 views • 58 slides
Induction & Recursion Weiss: ch 7.1 Recursion a programming strategy for solving

Induction & Recursion Weiss: ch 7.1 Recursion a programming strategy for solving

Induction & Recursion Weiss: ch 7.1 Recursion a programming strategy for solving large problems Think divide and conquer Solve large problem by splitting into smaller problems of same kind Induction A

662 views • 26 slides
PLTree A tree programming language Overview Philosophy: Everything is a tree All data structures

PLTree A tree programming language Overview Philosophy: Everything is a tree All data structures

PLTree A tree programming language Overview Philosophy: Everything is a tree All data structures are built on the tree A primitive type is a tree with a single node at the root and no leaves A string is a tree of characters A function is a

370 views • 13 slides
TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS

TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS

TREES AND THE LAW A GUIDE TO THE ESSENTIAL POINTS OF TREES AND THE LAW TREE PRESERVATION ORDERS A local planning authority can serve a TPO on tree(s) when it is expedient to do so. Such trees need to: Have a reasonable degree of

333 views • 10 slides

More recommend