MATLS 1M03 Lecture 10: 10 algorithms
30 Jan 2019
School
Department
Course
Professor
Document Summary
An algorithm: is a step by step process used to solve a specific problem. A manual operation performed by a person. An automated operation performed by a computer. Algorithm design: creating algorithms that solve a problem. Algorithm analysis: determining the efficiency of the algorithms. The time it takes for the algorithm to complete. The space the algorithm needs during its operation. Euclid"s algorithm: the greatest common divisor (gcd) of two positive integers is the largest positive integer that divides both integers without a remainder. Searching is the process of looking for a value with certain properties in a collection of values called search space. A linear search: is a process that examines the values in the research space one by one. A binary search: is a process that eliminates half of the search space from consideration after each step. Binary search is more efficient than linear search but require the search space to be stored in some way.
