Skip to content

Instantly share code, notes, and snippets.


Block or report user

Report or block tiger1710

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
View Tail Call Recursion.cpp
#include <iostream>
using namespace std;
int f(int n, int prev = 0, int next = 1) {
if (not n) return prev;
return f(n - 1, next, prev + next);
int main(void) {
cout << f(4) << '\n';
View Tail Call.cpp
#include <iostream>
using namespace std;
int f(int a) {
a = 0;
return a;
int foo1(int b) {
return f(b) + 1;
tiger1710 / Source.cpp
Last active Feb 11, 2019
기존의 피보나치수열의 재귀함수
View Source.cpp
#include <iostream>
using namespace std;
int f(int n) {
if (n < 0) return 0;
if (n < 2) return n;
return f(n - 1) + f(n - 2);
int main(void) {
View 구조체.md

C에서의 구조체


코딩 꼭 같이 해보면서 해보세요.. ㅠㅠ 그럼 더 이해 잘 될것 같네요..

1. 배경

만약 학생을 데이터로 표현하고 싶다고하면, 이름, 학번, 학년을 데이터로 저장해야 한다.

View avl.c
//avl트리 책에 있는 소스 수정
#include <stdio.h>
#include <stdlib.h>
typedef struct avl_node {
struct avl_node *left_child, *right_child; /* Subtrees. */
int data; /* Pointer to data. */
View main.cpp
#include <iostream>
using namespace std;
int main(void) {
cout << "Hello, World!" << endl;
return 0;
You can’t perform that action at this time.