Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    ALGO++: Recursion & Backtracking

    Uploaded by

    Utkarsh Maharana
    The document discusses various problem solving techniques like brute force search, divide and conquer, greedy algorithms, and dynamic programming. It provides examples of problems that can be solved using each technique, such as linear search, binary search, activity selection problems, and knapsack problem. The document also discusses recursion and provides examples of recursive problems like Fibonacci numbers, power function, printing numbers in increasing/decreasing order, and finding all subsequences of a string. Finally, it discusses C++ concepts like vectors, strings, sorting, and solving problems like N-Queen, Sudoku, rat in a maze, and phone keypad problems recursively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    ALGO++: Recursion & Backtracking

    Uploaded by

    Utkarsh Maharana
    34 views29 pages
    The document discusses various problem solving techniques like brute force search, divide and conquer, greedy algorithms, and dynamic programming. It provides examples of problems that can be solved using each technique, such as linear search, binary search, activity selection problems, and knapsack problem. The document also discusses recursion and provides examples of recursive problems like Fibonacci numbers, power function, printing numbers in increasing/decreasing order, and finding all subsequences of a string. Finally, it discusses C++ concepts like vectors, strings, sorting, and solving problems like N-Queen, Sudoku, rat in a maze, and phone keypad problems recursively.

    Original Description:

    chacha

    Original Title

    AL01

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses various problem solving techniques like brute force search, divide and conquer, greedy algorithms, and dynamic programming. It provides examples of problems that can be solved using each technique, such as linear search, binary search, activity selection problems, and knapsack problem. The document also discusses recursion and provides examples of recursive problems like Fibonacci numbers, power function, printing numbers in increasing/decreasing order, and finding all subsequences of a string. Finally, it discusses C++ concepts like vectors, strings, sorting, and solving problems like N-Queen, Sudoku, rat in a maze, and phone keypad problems recursively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    34 views29 pages

    ALGO++: Recursion & Backtracking

    Uploaded by

    Utkarsh Maharana
    The document discusses various problem solving techniques like brute force search, divide and conquer, greedy algorithms, and dynamic programming. It provides examples of problems that can be solved using each technique, such as linear search, binary search, activity selection problems, and knapsack problem. The document also discusses recursion and provides examples of recursive problems like Fibonacci numbers, power function, printing numbers in increasing/decreasing order, and finding all subsequences of a string. Finally, it discusses C++ concepts like vectors, strings, sorting, and solving problems like N-Queen, Sudoku, rat in a maze, and phone keypad problems recursively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 29

    Lecture 01

    Recursion &
    Backtracking
    ALGO++
    Recursion & Backtracking
    Problems

    Prateek Narang
    Problem Solving Techniques
    Brute Force/ Complete Search
    Greedy Methods
    Divide and Conquer
    Dynamic Programming

    ALGO++ 2
    Brute Force Search
    Linear Search
    Finding the largest/smallest number in an array
    Finding a pair in an array with sum as K

    Substrings of an array
    Subsequences of an array
    N-Queen using recursion
    Sudoku Solver using Recursion
    Rat in a Maze using Recursion

    ALGO++ 3
    Divide and Conquer
    Problems have dont have overlapping subproblems property.
    Divide the original problem into subproblems.
    Solve these subproblems.
    If needed, combine the sub-solutions to get complete solution.

    Examples-
    Binary Search
    Merge Sort
    Quick Sort
    Inversion Count
    Fast Power
    Square Root of Number

    ALGO++ 4
    Greedy Strategy
    - Greedy Algorithms make the choice that looks
    best at the moment.
    - You hope that by choosing a local optimum at
    each step, you will end at a global optimum.

    Examples -
    Counting Money Greedy (Indian Currency)
    Ith Largest Element in sorted array
    Activity Selection Problems
    Fractional Knapsack
    Load Balancing
    Some Graph Algorithms

    ALGO++ 5
    Dynamic Programming
    Problems having an optimal substructure and
    overlapping subproblems.

    Fibonacci Problem
    Ladders Problem
    Knapsack Problem
    And much more

    ALGO++ 6
    Lets start
    Pre-requisities
    Variables
    Data types
    Loops & Conditional Statements
    Functions
    Pointers
    Call by value & reference
    Basic algorithms searching, sorting, merging
    etc.

    ALGO++ 7
    Reference Variables
    Call by reference !

    ALGO++ 8
    Static vs Dynamic Memory

    ALGO++ 9
    Never Return Address of
    Local Variable !

    ALGO++ 10
    Call Stack!

    ALGO++
    12

    How to understand Recursion ?

    ALGO++
    13

    Time to talk about Recursion!

    ALGO++
    14

    What is Recursion?

    Recursion in computer science is a method


    where the solution to a problem depends on
    solutions to smaller instances of the same
    Problem.

    ALGO++
    Parts of Recursive Algorithm
    Base Case (i.e., when to stop)
    Work toward Base Case
    Recursive Call (i.e., call ourselves)

    The "work toward base case" is where we


    make the problem simpler. The recursive call, is
    where we use the same algorithm to solve a
    simpler version of the problem. The base case
    is the solution to the "simplest" possible problem

    ALGO++
    Problems
    Fibonacci Number

    Power Function in LogN

    Print Numbers from 1 to N


    Increasing Order
    Decreasing Order

    ALGO++ 16
    Problems
    Replace PI

    Tower of Hanoi

    Merge Sort

    ALGO++ 17
    Problems
    Subsequences of a String

    ALGO++ 18
    June 11,
    192017

    Find all subsequence of a string


    abc , a, b, c, ab, ac, bc, abc
    Before we think about recursive solution lets look at
    few things:
    We need this function to return an array of
    strings.
    But in C++ we know we cannot return array as
    this would be address of local variable.
    Instead we can pass it as argument and expect
    it to fill this array with the strings.
    We also need to know how many strings in this
    array were filled by the function so that we can
    iterate over it and print it.

    ALGO++
    June 11, 2017

    Lets find recursion in it.


    S() []
    S(c) [, c]
    S(bc) [, c, b, bc]
    S(abc) [, c, b, bc, a, ac,
    ab, abc]
    Figured out?
    S(abc) = S(bc) + copy of all S(bc) with
    a prefixed.

    ALGO++
    June 11, 2017

    STL
    Vectors
    StringClass
    Sorting & Comparators

    ALGO++
    N-Queen Problem

    ALGO++ 22
    Permutations of a String

    ALGO++ 23
    Sudoku Solver
    Create a Sudoku Solver and Checker

    ALGO++ 24
    Sample Input
    int mat[9][9] =
    {{5,3,0,0,7,0,0,0,0},
    {6,0,0,1,9,5,0,0,0},
    {0,9,8,0,0,0,0,6,0},
    {8,0,0,0,6,0,0,0,3},
    {4,0,0,8,0,3,0,0,1},
    {7,0,0,0,2,0,0,0,6},
    {0,6,0,0,0,0,2,8,0},
    {0,0,0,4,1,9,0,0,5},
    {0,0,0,0,8,0,0,7,9}};

    ALGO++ 25
    Rat in a Maze

    ALGO++ 26
    Phone Keypad

    ALGO++ 27
    HomeWork
    Read and Implement QuickSort

    ALGO++ 28
    Thank you
    ALGO++

    Prateek Narang

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy