danielrobertson’s gists

danielrobertson / vocab_1a.txt

Created October 30, 2022 07:43

Dongguk 1A vocab

danielrobertson / deploy storybook

Created May 3, 2022 17:29

	name: Build and Deploy Storybook
	on:
	push:
	paths: ["frontend-components/", ".storybook/"] # Trigger the action only when files change in the folders defined here
	jobs:
	build-and-deploy:
	runs-on: ubuntu-latest
	steps:
	- name: Checkout
	uses: actions/[email protected]

danielrobertson / index.html

Last active December 16, 2019 20:10

Filter photos by tags on click

	<!DOCTYPE html>
	<html>
	<script>
	const showTiles = function(tag) {
	// reset any previously hidden tiles
	if (tag !== "all") {
	showTiles("all");
	}

	// get all HTML elements with css class tile

danielrobertson / conway.js

Created February 12, 2019 19:09

Conway's game of life

	/*
	Input:
	an n by m grid of "alive" or "dead" cells

	Output:
	a transformation on the input grid using the following rules:
	- An "alive" cell remains alive if 2 or 3 neighbors are "alive." Otherwise, it becomes "dead."
	- A "dead" cell becomes alive if exactly 3 neighbors are "alive." Otherwise, it remains "dead."
	(The term "neighbor" refers to the at-most-8 adjacent cells horizontally, vertically, and diagonally.)

danielrobertson / firestoreUpload.js

Last active June 13, 2018 15:48

How to upload a list of JSON documents to Google Firestore. This script puts documents into a collection named "animals"

	const firebase = require("firebase-admin");
	const serviceAccount = require("./firebase-config.json"); // from the Firebase project overview page

	firebase.initializeApp({
	credential: firebase.credential.cert(serviceAccount),
	databaseURL: "https://<PROJECT_NAME>.firebaseio.com"
	});

	// this code could theoretically run in a Cloud Function as the back-end to a volunteer filling out a form,
	// or scraping a 3rd party animal database, which will spin through the records and create entries in Firestore

danielrobertson / RadixSort.java

Created July 10, 2016 23:16

Radix Sort

	void radixSort(int arr[], int maxDigits) {
	int exp = 1;
	for (int i = 0; i < maxDigits; i++) {
	ArrayList bucketList[] = new ArrayList[10];


	for (int k = 0; k < 10; k++) {
	bucketList[k] = new ArrayList();
	}

danielrobertson / QuickSort.java

Created July 10, 2016 23:15

Quick Sort

	void quickSort(int arr[], int left, int right) { //Confirmed
	int index = partition(arr, left, right);
	if (left < index - 1) { //when sorting 2 3 1, will return 2 1 3, left point at 3 and 2 1 unsorted
	quickSort(arr, left, index - 1);
	}
	if (index < right) { //when sorting 3 1 2, will return 1 3 2, index at 3 and right is 2.
	quickSort(arr, index, right);
	}
	}

danielrobertson / MergeSort.java

Created July 10, 2016 23:15

Merge Sort

	void mergesort(int[] array) {
	int[] helper = new int[array.length];
	mergesort(array, helper, 0, array.length - 1);
	}

	void mergesort(int[] array, int[] helper, int low, int high) {
	if (low < high) {
	int middle = (low + high) / 2;
	mergesort(array, helper, low, middle); // left
	mergesort(array, helper, middle + 1, high); // right

danielrobertson / BinarySearch.java

Created July 10, 2016 23:12

Binary Search

danielrobertson / IsPrime.java

Created July 10, 2016 00:55

Prime

Daniel danielrobertson