U6 Algorithms

U6 Algorithms Efficiency - ANSWER-A measure of how many steps are needed to complete an algorithm. Linear Search - ANSWER-A search algorithm which checks each element of a list in order until the desired value is found or all the elements in the list have been checked Binary search - ANSWER-a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data this process repeats until desired value is found where all the elements have been eliminated. Problem - ANSWER-A general description task that can or cannot be solved with an algorithm Algorithm - ANSWER-a finite set of instructions that accomplish a task Reasonable Time - ANSWER-Algorithms with a polynomial efficiency or lower, (constant, linear, square, cube, etc) Are said to run in a reasonable amount of time. Unreasonable Time - ANSWER-Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time. Heuristic - ANSWER-provides a "good enough" solution to a problem when an actual solution is impractical or impossible. Undecidable problem - ANSWE