Data Structures HW1
- 최초 등록일
- 2012.12.01
- 최종 저작일
- 2011.03
- 2페이지/ 한컴오피스
- 가격 2,000원
소개글
연세대학교 데이타구조 숙제입니다. 만점받았습니다
목차
(1) Brief explanation of the problem
(2) Your view as to how it ties with what we covered in class
(3) Discussion of your results
(4) Short explanation of your code
(5) Your code
본문내용
(1) Brief explanation of the problem
- Because a function S(n), which is given the problem is defined in terms of itself, we can know that this problem is related with a recursive function. The problem assumed three things. If a variable become zero then the output should be zero , if a variable become even number then the output should be S(n-1)+n and if a variable become odd number then the output should be S(n-1)*n. Finally we should find the output when a variable become 42. It is a goal of the problem.
참고 자료
없음