Algorithm
1.알고리즘 Assignment 1
1\. Manually determine the pairs of you who have the same birthday. Explain your method of solution.1) 그룹의 생일을 모두 기록받아 하나씩 비교한다.2) 모든 학생에게 임의의 숫자 번호(1
2023년 3월 13일
2.알고리즘 Assignment 2
What is the time complexity T(n) of the nested loops below? For simplicity, you may assume that n is a power of 2.That is, n = 2k for some positive in
2023년 3월 13일
3.알고리즘 Assignment 3
1. Prove that the smallest height for any tree on n nodes is Ω(lg n) = - 1 + lg(n+1). 2. When you shrink the space of direct access arrays, you might
2023년 3월 20일
4.알고리즘 Assignment 6
Read chapters 7.1 – 7.7. Solve the exercise problem 14 of the chapter 7. Refer to graph examples 1 and 2 on pages 21-22 of the class material titled '
2023년 4월 10일