Algorithms

1. What are algorithms used for? is a sequence of finite instructions, often used for calculation and data processing, is a process that calculates something

2. What is a random algorithm?
is the random selection of bits of codes to minimize run time?


3. What is compression?
the process of encoding information using fewer bits.

4. What two “real world” examples does the author give as useful algorithms? Describe them on your blog.
The two “real world” examples use in the author Blog was “Maximum Flow” and “Sequence comparison”. Maximum Flow is the use dynamic programming to determine the best way to get some equipment from one place to another through a network of sorting. Basically dealing with efficiency and time. Sequence comparison calculates the minimum numbers of insertions, deletion, and edits required to transform a sequence of “A” and “ B.”


5. Do you agree that studying algorithms is a useful tool for programmers and computer scientists?
I agree that it can be useful and productive. I understand that it can make the code more efficient and streamline. I now understand the runtime in realtionship to the coding.