Skip to content

Instantly share code, notes, and snippets.

@parkj90
parkj90 / list.c
Last active September 15, 2018 01:11
queue with doubly linked list
//list.c
#include <stdio.h>
#include <stdlib.h>
#include "list.h"
struct list {
struct node *head;
struct node *tail;
unsigned int size;
@parkj90
parkj90 / array.c
Created August 26, 2018 20:31
queue with dynamic array
//array.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "array.h"
array_t *array_new(void) {
array_t *array = malloc(sizeof(array_t));
if (array == NULL) {
@parkj90
parkj90 / array.c
Created August 21, 2018 02:54
dynamic array with void pointer
//array.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "array.h"
array_t *array_new(void) {
array_t *array = malloc(sizeof(array_t));
if (!array) {
@parkj90
parkj90 / list.c
Created August 21, 2018 02:46
doubly linked list
//list.c
#include <stdio.h>
#include <stdlib.h>
#include "list.h"
static void print(int value);
list_t *list_new(node_t *node) {
list_t *list = malloc(sizeof(list_t));
@parkj90
parkj90 / list.c
Last active July 30, 2018 22:59
linked list
//list.c
#include <stdio.h>
#include <stdlib.h>
#include "list.h"
static void print(int value);
list_t *list_insert(list_t *list, int value) {
list_t *node = malloc(sizeof(list_t));
@parkj90
parkj90 / array.c
Last active June 9, 2019 03:13
dynamic array
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "array.h"
array_t *array_new(void) {
array_t *array = malloc(sizeof(array_t));
if (array == NULL) {
return NULL;
}
@parkj90
parkj90 / wikiCrawler.py
Last active May 25, 2017 19:06
wikipedia challenge
import sys
import requests
from lxml import html
import time
if len(sys.argv) < 2:
print("Usage: {} URL [page jump limit]".format(sys.argv[0]))
exit()
link = sys.argv[1]