MY MEMO
문제해결기법 카테고리의 있는 모든 문제는 인하대학교 컴퓨터정보공학부 문제해결기법 (2017) 수업 중에 나온 문제임을 알려드립니다.
+) 출처 : http://ledgku.tistory.com/39 #include #include #include #include using namespace std; void HanoiTowerMove(int num, char from, char by, char to) { if (num == 1) { printf("원반1을 %c에서 %c로 이동\n", from, to); } else { HanoiTowerMove(num - 1, from, to, by); printf("원반%d를 %c에서 %c로 이동\n", num, from, to); HanoiTowerMove(num - 1, by, from, to); } } int main(int arc, char** argv) { printf("하노이 타워 재귀 ..
[MACHINE LEARNING] Classification and Simplified cost function & Gradient Descent
+) this post is based on the lecture and content in the coursera(https://www.coursera.org/) machine learning class (professor)ClassificationTo attempt classification, one method is to use linear regression and map all predictions greater than 0.5 as a 1 and all less than 0.5 as a 0. However, this method doesn't work well because classification is not actually a linear function. The classificatio..