Skip to content

Instantly share code, notes, and snippets.

View JeonghunLee's full-sized avatar
🤗
I may be slow to respond.

JeongHun (James) Lee JeonghunLee

🤗
I may be slow to respond.
View GitHub Profile
#include <stdio.h>
// general recursion
int factorial(int n)
{
if(n==0)
return 1;
else
return n * factorial(n-1);
}
/*
Quick sort example 3
*/
#include <stdio.h>
//SETTING QUICK SORT, PIVOT POSITION
#define PIVOT_LEFT
//#define PIVOT_RIGHT
#include <stdio.h>
#define MAX 10
int size=0;
int head=0; // not used in stack
int tail=0;
int queue[MAX];
int stack[MAX];
#include <stdio.h>
#include <stdlib.h>
typedef struct ListElmt_ {
void * data;
struct ListElmt_ *next;
}ListElmt;
typedef struct List_ {
// blogspot test 용 입니다.
#include<stdio.h>
int main()
{
printf(" blogspot test 용 입니다. \n");
return 0;
}
#include<stdio.h>
//Jeonghun Lee, this is second test code.
int main()
{
printf ("Test Github1 , gist test ");
return 0;
}
#include<stdio.h>
//Jeonghun Lee, this is first test code.
int main()
{
printf ("Test Github1 , gist test ");
return 0;
}