ta1hia

__author__ = 'shawli'

#no duplicates

class Trie:

    def __init__(self, ch=""):
        self.ch = ch #character
        self.br = [] #branches

ta1hia

package main

import (
        "encoding/gob"
        "fmt"
        "os"
        "time"
)

func main() {

ta1hia

package main

import (
	"fmt"
	"math"
	"strconv"
	"strings"
)

func IPToInt(ip string) uint {

ta1hia

import xmltodict
import os
import json
import requests

def request_user_shelves(parms):
    p = dict(parms.items() + {"key":os.environ.get("GOODREADS_ACCESS_KEY")}.items())
    resp = requests.get("https://www.goodreads.com/shelf/list.xml",p)
    data_dict = xmltodict.parse(resp.content)
    data_dict = data_dict['GoodreadsResponse']['shelves']

ta1hia

#include <stdio.h>

void qsort(int *X, int L, int U) {
    int T, M, i, tmp;
    if (L < U) {
        T = X[L];
        M = L;
        for (i = L+1; i < U; i++) {
            if (X[i] < T) {
                M += 1;

ta1hia

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


typedef struct Node {
    struct Node *prev;
    struct Node *next;
    int data;
} Node;

ta1hia

class Node:
    def __init__(self, data):
        self.data = data
        self.lchild = None
        self.rchild = None

    def insert(self, key):
        if key < self.data:
            if self.lchild:
                self.lchild.insert(key)

ta1hia

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

#define N    10

typedef struct {
    int y;
    int weight;
    struct Edge *next; /* next in adj list */

ta1hia

# graph.py

class Vertex:
    def __init__(self, x):
        self.x = x
        self.edges = {}

    def __str__(self):
        return "Vertex %d: %s" % (self.x, self.edges)

ta1hia

def find_cycles(g, x, path, num_cycles):
    if x in path:
        num_cycles+=1
        return num_cycles

    path.append(x)

    N = len(g[x])
    for i in range(N):
        if g[x][i]: