Skip to content

Instantly share code, notes, and snippets.

View corehello's full-sized avatar
🏠
Working from home

corehello corehello

🏠
Working from home
View GitHub Profile
@corehello
corehello / circle.c
Created September 1, 2016 05:43
draw a circle in c lang.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
typedef struct {
size_t width;
size_t height;
unsigned char *data;
} Image;
@corehello
corehello / snake_array.c
Created February 7, 2017 05:44
snake array
#include <stdio.h>
#include <stdlib.h>
int main (int ac, char* av[])
{
int number = atoi(av[1]);
//number = 5;
int i=0,j=0;
int direction=0;
/*
@corehello
corehello / 8queen.c
Created March 11, 2017 07:57
8 queen puzzle solver
#include <stdio.h>
/*
You can define the size of Queens
*/
#define QUEEN 8
int row[QUEEN+1];
int l[2*QUEEN];
int r[2*QUEEN];
@corehello
corehello / split-nums.lisp
Created March 15, 2017 05:03
split number to odd list and even list which number is less than n but more than 0
(defun split-nums (n)
(if (>= n 0)
(if (= n 0)
'((0) NIL)
(if (oddp n)
(map 'list #'append `(NIL (,n)) (split-nums (- n 1)))
(map 'list #'append `((,n) NIL) (split-nums (- n 1)))))))
package main
import (
"crypto/tls"
"flag"
"io"
"log"
"net"
"net/http"
"time"
@corehello
corehello / collatz-conjecture.lisp
Last active December 14, 2019 12:41
collatz-conjecture in common lisp
(defun collatz-conjecture (n)
(progn
(print n)
(cond
((= n 1) n)
((= (mod n 2) 0) (collatz-conjecture (/ n 2)))
((= (mod n 2) 1) (collatz-conjecture (+ 1 (* n 3)))))))
@corehello
corehello / cell-tests.rs
Created September 10, 2020 14:00 — forked from jonhoo/cell-tests.rs
cell-refcell-rc
// these aren't _quite_ functional tests,
// and should all be compile_fail,
// but may be illustrative
#[test]
fn concurrent_set() {
use std::sync::Arc;
let x = Arc::new(Cell::new(42));
let x1 = Arc::clone(&x);
std::thread::spawn(move || {
(defun fib3 (n)
(cond ((= n 1) 1)
((= n 2) 2)
((= n 3) 4)
(t (+ (fib3 (- n 1))
(fib3 (- n 2))
(fib3 (- n 3))))))
@corehello
corehello / quicksort.py
Created January 11, 2021 11:06
quicksort in python - most understandable
def qsort(arr):
if len(arr) <= 1:
return arr
else:
# construct array with [(values bigger than pivot), pivot, (values smaller than pivot)]
return qsort([x for x in arr[1:] if x > arr[0]]) + \
[arr[0]] + \
qsort([x for x in arr[1:] if x <= arr[0]])
@corehello
corehello / perm.py
Created January 11, 2021 15:28
string permutation
def perm(string):
if len(string) <= 1:
return [string]
return [i+j for idx,i in enumerate(string)
for j in perm(string[0:idx] + string[idx+1:])]
if __name__ == "__main__":
TCs = [
("a", ["a"]),
("ao", ["ao", "oa"])