# Overview **Algorithms and Programming** - Developing Algorithms - Algorithmic Efficiency - Binary Search # Learning Objectives **Enduring Understanding** #AAP-2 The way statements are sequenced and combined in a program determines the computed result. Programs incorporate iteration and selection constructs to represent repetition and make decisions to handle varied input values. #AAP-4 There exist problems that computers cannot solve, and even when a computer can solve a problem, it may not be able to do so in a reasonable amount of time. ## Developing Algorithms #AAP-2.L Compare multiple algorithms to determine if they yield the same side effect or result. #AAP-2.M For algorithms: a. Create algorithms. b. Combine and modify existing algorithms. --- ## Algorithmic Efficiency #AAP-4.A For determining the efficiency of an algorithm: a. Explain the difference between algorithms that run in reasonable time and those that do not. b. Identify situations where a heuristic solution may be more appropriate. --- ## Binary Search #AAP-2.P For binary search algorithms: a. Determine the number of iterations required to find a value in a data set. b. Explain the requirements necessary to complete a binary search. --- # Learning Series ## Series 1 - ### Episode 1 - #ES-KN Essential knowledge description ### Episode 2 - #ES-KN Essential knowledge description --- ## Series 2 - ### Episode 1 - #ES-KN Essential knowledge description ### Episode 2 - #ES-KN Essential knowledge description --- ## Series 3 - ### Episode 1 - #ES-KN Essential knowledge description ### Episode 2 - #ES-KN Essential knowledge description