Paul Knittel xypaul

## gist:2afc58842d1890716af5
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <pthread.h>
#include <unistd.h>
#include <semaphore.h>

sem_t semaphore;

void threadfunc() {

## gist:4701837c4360c1012781
    public static Boolean powerCheck(int a) {
        return a!=0 && (a & a-1) == 0;
    }


    public static Boolean recursivePowerCheck(int a){
        if (a == 1) return true;
        if (a == 0 || a % 2 != 0) return false;
        return recursivePowerCheck(a/2);
    }

## kmyself.m
function[r,l] = kmyself(dataSet, k)

    % Determine the size of dataSet
    [nRow, nCol] = size(dataSet);

    % Empty array for cluster assesment
    clusterAssment = zeros(nRow,2);

    % Setup centroid and choose on to start of with
    centroids = zeros(k,nCol);

## main.m
function main()

    % LOAD IRIS
    % dataset was modified by changing the class name from string to a
    % number
    iris = load('iris.csv', ',');

    % LOAD SONAR
    sonar = load('sonar.csv', ',');

## merge2.js
function sort(array) {
  var len = array.length;

  if (len <= 1) {
    return array;
  }

  var middle = Math.floor(len*0.5);
  var left = array.slice(0,middle);
  var right = array.slice(middle, len);

## merge.js
function sort(array) {
  var len = array.length;
  var middle = Math.floor(len*0.5);
  var left = array.slice(0,middle);
  var right = array.slice(middle, len);

  if (len == 1) {
    return array;
  } else {


## index.html
<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>JS Bin</title>
</head>
<body>

<script id="jsbin-javascript">
function quickSort(array, start, end) {

## main.java
import java.io.*;
import java.util.*;


public class Main {

	private static Stack[] Blocks;
	private static PrintWriter out;

	public static void main(String[] args) throws Exception {

## index.html
<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>JS Bin</title>
</head>
<body>
  <div id="ex"></div>
<script id="jsbin-javascript">
function qsort(ls){

## main.java
import java.io.*;
import java.util.*;


public class Main {

	private static Stack[] Blocks;
	private static PrintWriter out;

	public static void main(String[] args) throws Exception {
	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <pthread.h>
	#include <unistd.h>
	#include <semaphore.h>

	sem_t semaphore;

	void threadfunc() {
	public static Boolean powerCheck(int a) {
	return a!=0 && (a & a-1) == 0;
	}


	public static Boolean recursivePowerCheck(int a){
	if (a == 1) return true;
	if (a == 0 \|\| a % 2 != 0) return false;
	return recursivePowerCheck(a/2);
	}
	function[r,l] = kmyself(dataSet, k)

	% Determine the size of dataSet
	[nRow, nCol] = size(dataSet);

	% Empty array for cluster assesment
	clusterAssment = zeros(nRow,2);

	% Setup centroid and choose on to start of with
	centroids = zeros(k,nCol);
	function main()

	% LOAD IRIS
	% dataset was modified by changing the class name from string to a
	% number
	iris = load('iris.csv', ',');

	% LOAD SONAR
	sonar = load('sonar.csv', ',');
	function sort(array) {
	var len = array.length;

	if (len <= 1) {
	return array;
	}

	var middle = Math.floor(len*0.5);
	var left = array.slice(0,middle);
	var right = array.slice(middle, len);
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<title>JS Bin</title>
	</head>
	<body>

	<script id="jsbin-javascript">
	function quickSort(array, start, end) {
	import java.io.*;
	import java.util.*;


	public class Main {

	private static Stack[] Blocks;
	private static PrintWriter out;

	public static void main(String[] args) throws Exception {