4
Orange line computed one average Blue dots Midterm 1 scores SOFARDy program.mg Aim for recursive backtracking bruteforce t recursion Describe the problem you're trying to solve What do I need to remember INPUT about past decisions What am I trying to figure out about future decisions OUTPUT Design a recursive algorithm What is the next decision Removing redundancy adding efficiency Memo ization structure Evaluation order Analyze time

Orange line one Blue dots Midterm 1 scores

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Orange line one Blue dots Midterm 1 scores

Orange line computed one averageBlue dots Midterm 1 scores

SOFARDy

program.mgAim for recursive backtrackingbruteforce t recursion

Describe the problem you're trying to solveWhatdo I need to remember INPUTabout past decisionsWhat am I trying to figureout about future decisions OUTPUT

Design a recursive algorithmWhat is the next decision

Removingredundancy adding efficiencyMemo ization structure

Evaluation order

Analyze time

Page 2: Orange line one Blue dots Midterm 1 scores

III.tnIstANCE ALGORITHMS

ALEOXRIIX.EEALTRUISTICteleptaEments

libcurses

IT a In001101010111

We're looking for a sequence of pairsALGO FI

JIHYENeed to remember

ALTRUIS past string unprocessedfuture

chars in each

Edit i j edit distance betweenprefix ACI iandprefix B 1 j

Recursivequestion What's in the last columnWhat's the last op

SEIS IEEE IEEEBIitij Enditlifteditlif

X 0

18 103 818LIED B DEIFIED

Page 3: Orange line one Blue dots Midterm 1 scores
Page 4: Orange line one Blue dots Midterm 1 scores