Skip to content

Instantly share code, notes, and snippets.

View ANTALLIS's full-sized avatar
💭
🦀

Antonio Allis ANTALLIS

💭
🦀
View GitHub Profile
import time
def sieve(max_num):
array = []
primearray = []
for i in range(max_num):
array.append(1)
for i in range(2, max_num):
mult_num = i
@ANTALLIS
ANTALLIS / Merge_sort.py
Created May 4, 2018 20:04
Does exactly what it says
import random
def merge(left, right):
result = []
while len(left) != 0 and len(right) != 0:
if left[0] <= right[0]:
result.append(left.pop(0))
else:
result.append(right.pop(0))
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char* argv[]) {
printf(“Hello World!”);
Return 0;
}
from machine import Pin, I2C, PWM
import utime
import time
from time import sleep
import mcp23017
import network
from umqtt.simple import MQTTClient
#functions
"""pinMode(pin, mode);
html, body, div, span, applet, object, iframe,
h1, h2, h3, h4, h5, h6, p, blockquote, pre,
a, abbr, acronym, address, big, cite, code,
del, dfn, em, font, img, ins, kbd, q, s, samp,
small, strike, strong, tt, var,
dl, dt, dd, ol, ul, li,
fieldset, form, label, legend,
table, caption, tbody, tfoot, thead, tr, th, td {
margin: 0;
padding: 0;