Solutions
-
[Introduction to Algorithms, CLRS] Exercise 1.1-5알고리즘 2017. 8. 15. 09:39
This is a solution for Introduction to Algorithms. I write this for my study purpose. 1.1-5 Come up with a real-world problem in which only the best solution will do. Then come up with one in which a solution that is “approximately” the best is good enough. Answer: Sorting a catalog is the problem, where only the best solution will do. An "approximately" sorted catalog won't be useful. Finding t..
-
[Introduction to Algorithms, CLRS] Exercise 1.1-3알고리즘 2017. 8. 14. 13:19
This is a solution for Introduction to Algorithms. I write this for my study purpose. 1.1-3 Select a data structure that you have seen previously, and discuss its strengths and limitations. Answer: I would like to introduce 2 data structures: singly linked list and array. Data structure Strengths Limitations Singly linked list - It does not need sequential space in memory. - We can insert a new ..
-
[Introduction to Algorithms, CLRS] Exercise 1.1-1알고리즘 2017. 8. 14. 12:14
This is a solution for Introduction to Algorithms. I write this for my study purpose. 1.1-1 Give a real-world example that requires sorting or a real-world example that re- quires computing a convex hull. Answer: 1) Sorting: - Contact list in my smart phone, alphabetically sorted. - Email list in Gmail app, sorted in time. 2) Convex Hull: (I think this is the most interesting answer that I found..