jarehec

def word_count_engine(doc: str):
    words = {} 
    word = [] 
    pos = 0
    result = [] 
    
    # build word list and frequency
    for i, c in enumerate(doc.lower()): 
        if c >= 'a' and c <= 'z': 
            word.append(c) 

jarehec

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

void print_int_array(int ar[], size_t size) {
	int i;
	for (i = 0; i < size; i++)
		(i + 1) < size ? printf("%d, ", ar[i]): printf("%d\n", ar[i]);
}

void swap(int *x, int *y) {

jarehec

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

void print_int_array(int ar[], size_t size) {
	int i;
	for (i = 0; i < size; i++)
		(i + 1) < size ? printf("%d, ", ar[i]): printf("%d\n", ar[i]);
}

void swap(int *x, int *y) {

jarehec

#!/bin/bash
## UNLICENSE file for license information

# Misc checks
if [ $(id -u) -ne 0 ]
then
	echo "This script needs root to work." # It really does. We're installing packages.
	exit 1
fi

jarehec

# writes 'Hello, Monty' to stdout
push 121
push 116
push 110
push 111
push 77
push 32
push 44
push 111
push 108

jarehec

numb1 = float(input('first number: '))
op = input('choose an operator: /,*,-,+ ')
numb2 = float(input('second number: '))
if op == '/':
	print(numb1 / numb2)
elif op == '*':
	print(numb1*numb2)
elif op == '-':
	print(numb1 - numb2)
elif op == '+':

jarehec

using System;
using System.Linq;

namespace sort
{
    class Program
    {
        static void Main(string[] args)
        {
            string line = "this,will,be,sorted,alphabetically";

jarehec

Keybase proof

I hereby claim:

• I am jarehec on github.
• I am jarehec (https://keybase.io/jarehec) on keybase.
• I have a public key ASAKQCYJ4Syro0WUcfjYyGa2s8_h-Thkx0oF1dUN2qpCOAo

To claim this, I am signing this object: