Austin Coding Academy Blog Post 206

1. Tell us about something you learned this week. Answer: I learned more about extending classes to other classes.
2. What are the pros and cons of immutability? Answer: SEE https://stackoverflow.com/questions/1863515/pros-cons-of-immutability-vs-mutability
3. How can you achieve immutability in your own code? Answer: There are different libraries that help you do this. For small scale examples I guess you can use the keyboard const to not change that data.
4. What are Divide and Conquer algorithms? Describe how they work. Can you give any common examples of the types of problems where this approach might be used? Answer: Divide and Conquer algorithms break the problem into smaller subproblems then the subproblems are combined to get an answer. The Quicksort algorithm would be an example of a divide and conquer algorithm.
5. How do insertion sort, heap sort, quick sort, and merge sort work? Answer: https://ibonelli.github.io/info1_presentations/files/clase12/Sorting%20Algorithms.pdf
6. What are the key advantages of insertion sort, quick sort, heap sort and merge sort? Discuss best, average, and worst case time and memory complexity. Answer: https://ibonelli.github.io/info1_presentations/files/clase12/Sorting%20Algorithms.pdf
7. Explain the difference between mutable and immutable objects. Answer: mutable objects can be altered after creation. Immutable objects cannot be changed after creation.
8. What are the three laws of algorithm recursion? Describe them in your own words and what they mean to you. Answer: A recursive algorithm must have a base case. It must change its state and move toward the base case not away from it. It must call itself recursively.