Recursion.

Slides:



Advertisements
Similar presentations
New Mexico Computer Science For All
Advertisements

Chapter 4 Mathematical Induction Used to verify a property of a sequence 2,4,6,8,… for i >= 1 a i = 2i –infinite sequence with infinite distinct values.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
IB Computer Science – Logic
Chapter 6 Questions Quick Quiz
Sequences & Series. Sequence: A function whose domain is a set of consecutive integers. The domain gives the relative position of each term of the sequence:
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
The Accumulator Pattern Motivating Example: Suppose that you want to add up (“accumulate”) 1 2 plus 2 2 plus 3 2 plus … plus You could use: total.
Power Series A power series is an infinite polynomial.
Canvas and Arrays in Apps
Linear Equations by Dr. Shorouk Ossama.
Fractals.
Python Loops and Iteration
Lesson #6 Modular Programming and Functions.
Recursive stack-based version of Back-chaining using Propositional Logic
Relations Objectives The student will be able to:
Lesson #6 Modular Programming and Functions.
Data Structures and Algorithms
Frank Tsui Software Engineering
Topic: Recursion – Part 1
Complex numbers Algebra II Dr. Guram.
Functions & Relations.
GEOMETRY SOL 5.13.
Boundary value Analysis
Algebra 1 Section 1.7 Identify functions and their parts
Bryan Burlingame 26 September 2018
Discrete Mathematics and Its Applications
Lesson #6 Modular Programming and Functions.
Chapter 6 Repetition Objectives ❏ To understand basic loop concepts:
CS149D Elements of Computer Science
Chapter 10: Mathematical proofs
Copyright © Cengage Learning. All rights reserved.
Chapter 3: The CHURCH-Turing thesis
Warm - Up Graph each equations on its own coordinate plane.
Introduction to Object-Oriented Programming with Java--Wu
Repetition Structures
COUNTING AND PROBABILITY
CSE 311: Foundations of Computing
Increasing and Decreasing Functions
Design and Implementation
Recursion (part 1) October 24, 2007 ComS 207: Programming I (in Java)
Aim: What is the sequence?
Sequences and Series.
Copyright © Cengage Learning. All rights reserved.
11.2 Series.
READY?.
Lesson #6 Modular Programming and Functions.
Domain and Range.
Bryan Burlingame 6 March 2019
12 Further mathematics Recurrence relations.
Domain and Range.
Topics Introduction to Repetition Structures
Domain and Range.
EQUATIONS OF A STRAIGHT LINE
Graphs & Trees.
Find the area of the surface obtained by rotating the curve about the x-axis. {image} {image}
Find the area of the surface obtained by rotating the curve about the x-axis. {image}
The structure of programming
Domain and Range.
Domain and Range.
8.1 Defining and Using Sequences and Series
UML State Diagrams.
Thinking procedurally
2.1 Domain and Range.
Recursion (part 1) October 25, 2006 ComS 207: Programming I (in Java)
Legacy Databases.
DAGs Longin Jan Latecki
Recursion 1. The computer science equivalent of mathematical induction. 2. A way of defining something in terms of itself. 3. Ex. f(n) = 1,
Recursive Definitions
Computer Science 210 Computer Organization
Presentation transcript:

Recursion

Recursion is the process of repeating items in a self-similar way.

For instance, when the surfaces of two mirrors are exactly parallel with each other, the nested images that occur are a form of infinite recursion.

The term has a variety of meanings specific to a variety of disciplines ranging from linguistics to logic.

The most common application of recursion is in mathematics and computer science, in which it refers to a method of defining functions in which the function being defined is applied within its own definition.

Specifically, this defines an infinite number of instances (function values), using a finite expression that for some instances may refer to other instances, but in such a way that no loop or infinite chain of references can occur.

The term is also used more generally to describe a process of repeating objects in a self-similar way.