Notes for unit

Learnings

  • Can be used in situations where loops are used
  • Must call itself and have a base case

Recursion

  • Method that calls itself. Must have two parts: a base case and a recursive call.

Big O Notation

  • Describes time complexity for code to run

Binary Search

  • data to be in sorted order to use.
  • algorithm coninuously halves the data until the wanted value is found
  • efficient compared to linear search

Homework

  • Kahoot complete
  • Google form - one question missed