Paul Knittel xypaul

xypaul / gist:2afc58842d1890716af5

Created October 28, 2015 00:14 — forked from tausen/gist:4261887

pthread, sem_wait, sem_post example

xypaul / gist:4701837c4360c1012781

Created June 24, 2015 00:58

Power of 2 - recursive and bitwise :)

	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);
	}

xypaul / kmyself.m

Created June 5, 2015 05:30

My own implementation of kMeans Machine Learning algorithm in Matlab

	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);

xypaul / main.m

Created June 5, 2015 05:29

Recreating the dataset from the MFS Paper by Bayne

	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', ',');

xypaul / merge2.js

Last active August 29, 2015 14:22

Improved Merge Sort JavaScript - http://jsbin.com/wiyaja

	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);

xypaul / merge.js

Last active August 29, 2015 14:22

Merge Sort JavaScript

	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 {

xypaul / index.html

Created May 28, 2015 02:03

Improved Quick Sort Algorithm in JavaScript

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

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

xypaul / main.java

Created May 28, 2015 01:03

101 - The Blocks Problem

	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 {

xypaul / index.html

Created May 28, 2015 00:58

Quick sort implementation in JavaScript

xypaul / main.java

Created May 27, 2015 09:10

101 - The Blocks Problem

	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 {