JeonghunLee

#include<stdio.h>
 
//Jeonghun Lee, this is first test code.  
 
int main()
{
  printf ("Test Github1 , gist test ");
  return 0;
}

JeonghunLee

#include<stdio.h>
 
//Jeonghun Lee, this is second test code.  
 
int main()
{
  printf ("Test Github1 , gist test ");
  return 0;
}

JeonghunLee

#include <stdio.h>
#include <string.h>

#define MAX_HASH  20

#define HASH_KEY		0
#define HASH_VAL		1

static int hashmap[MAX_HASH][2]={0}; // open-addressing hash, pointer
static int hashsize=0;

JeonghunLee

#include <stdio.h>
#include <string.h>

int getStrlens(char str[])
{
	int cnt=0;
	
	while(str[cnt] !='\0')
		cnt++;
	

JeonghunLee

#include <stdio.h>

#define CNT_TEST	2

int map[20]={0};  // save address info 
int size=0;

int map2[20]={0};  // save address info 
int size2=0;

JeonghunLee

#include <stdio.h>

// general recursion
int factorial(int n)
{
  if(n==0)
    return 1;
  else
    return n * factorial(n-1);   
}

JeonghunLee

#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];

JeonghunLee

#include <stdio.h>

int  *aa[10]={0};
int (*bb)[10]={0};
int  cc[10];
/*
  Output 
  
  *aa[10]=40 byte (*bb)[10]=4 byte cc[10]=40  byte 
*/

JeonghunLee

#include <stdio.h>
#include <stdlib.h>

typedef struct sListElemt_{
	int data;
	struct sListElemt_ *next ;
}sListElemt;

typedef struct sList_{
	int size;

JeonghunLee

// blogspot test 용 입니다. 

#include<stdio.h>

int main()
{
   
     printf(" blogspot test 용 입니다. \n");
     return 0;
}