Unit #3-03

Learning Outcome

At the end of this lesson, you will be able to:

• understand and use recursion

  • binary search

First!

• Big O notation

  • having code that is "efficient" can be critically important

  • see this: https://www.youtube.com/watch?v=g2o22C3CRfU 

Lesson

• read "Functions", Chapter 3, Computer Based Problem Solving

  • read "Recursion"

Daily Assignment

• not only the "Factorial" program but many other things can also be done recursively

• one of them is the "Binary Search"

  • here is a Binary Search program starter

    • https://github.com/Mr-Coxall/ICS4U-Unit3-03-Java-Binary-Search-Starter

  • we know this is a "bad" function, since it is referring to a global array!

    • we will forgive ourselves today

Extra

• do the above in a second language