dazfuller

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

void PrintList(const vector<int>& list)
{
    for (auto i : list)
    {

dazfuller

#include <functional>
#include <iostream>
#include <vector>

#include <math.h>

using namespace std;

double Sum(const vector<double>& values, function<double (double x)> f)
{

dazfuller

import java.io.ByteArrayOutputStream;
import java.io.InputStream;
import java.io.StringReader;

import javax.xml.parsers.DocumentBuilder;
import javax.xml.parsers.DocumentBuilderFactory;
import javax.xml.transform.Transformer;
import javax.xml.transform.TransformerFactory;
import javax.xml.transform.dom.DOMSource;
import javax.xml.transform.stream.StreamResult;

dazfuller

package main

import (
    "fmt"
    "math"
)

var (
    DELTA float64 = 1e-15
)

dazfuller

package main

import (
    "fmt"
    "strings"
)

var ignoreNonASCII bool = false

// Converts a given string to it's ASCII representation, if the ignore parameter

dazfuller

package main

import "fmt"

func MakeFibonacciGenerator() chan int {
    a, b := 0, 1
    c := make(chan int)
    
    go func() {
        for {

dazfuller

package primes

// Simple function for checking if a value coming in on a channel is divisible by a 
// divisor, if it is then it is passed to the output channel
func checkDivisor(divisor int64, in chan int64, out chan int64) {
	for {
		val := <-in
		if val % divisor != 0 {
			out <- val
		}

dazfuller

package primes

import (
    "container/list"
    "math"
)

// Simple function for checking if a value coming in on a channel is divisible by a 
// divisor, if it is then it is passed to the output channel
func checkDivisor(divisor int64, in chan int64, out chan int64) {

dazfuller

package main

import (
    "fmt"
)

func numberOfDivisors(n int64) int64 {
    if n % 2 == 0 {
        n /= 2
    }

dazfuller

#include <iostream>
#include <time.h>

using namespace std;

unsigned long* _chains;
unsigned long _chainLength;

double DiffClock(clock_t t0, clock_t t1)
{