Lee Zhen Yong bruceoutdoors

## TableToTree.js
function Leaf(name)
{
    this.Name = name;
    this.ParentBranch = null;
}

Branch.prototype = new Leaf();
Branch.prototype.constructor = Branch;
Branch.prototype.Super = Leaf.prototype;

## example-run-sjf.txt
[bruceoutdoors@BruceManjaro bash]$ ./sjf.sh input.txt
Process Name: P1
Arrival Time: 2
Burst Time: 6
Priority: 7

Process Name: P2
Arrival Time: 1
Burst Time: 8
Priority: 1

## meaure-run-time.cpp
/*
sample run:
    ./measure-run-time < source-input.txt

output:
2
4
100

** elapsed time: 0.523ms **

## generic-lis.cpp
#include <iostream>
#include <functional>
#include <deque>
#include <vector>

using namespace std;

template<typename T>
deque<T> find_lis(const vector<T> &a,
	function<bool(const T &, const T &)> comp = [&](const T &a, const T &b)->bool { return a < b; })

## mat-chain-mult-recursive.cpp
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>

using namespace std;

vector<int> rc;

int B(int i, int j)

## mat-chain-mult-dp.cpp
#include <algorithm>
#include <iostream>
#include <vector>
#include <climits>

using namespace std;

vector<int> rc;
vector< vector<int> > DP;

## mat-chain-mult-dp-trace.cpp
#include <algorithm>
#include <iostream>
#include <vector>
#include <climits>
#include <string>

using namespace std;

vector<int> rc;
vector< vector<int> > DP, splits;

## csv.cpp
#include "csv.h"
#include <fstream>
#include <sstream>
#include <stdexcept>

Csv::Csv(const string &dir)
{
	directory = dir;
	read(dir);
}

## knapsack-select.cpp
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> v, c;
vector< vector<int> > DP;

void pick(int i, int w)

## knapsack-dp.cpp
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	vector<int> v, c;
	int S, N; cin >> S >> N;
	function Leaf(name)
	{
	this.Name = name;
	this.ParentBranch = null;
	}

	Branch.prototype = new Leaf();
	Branch.prototype.constructor = Branch;
	Branch.prototype.Super = Leaf.prototype;
	[bruceoutdoors@BruceManjaro bash]$ ./sjf.sh input.txt
	Process Name: P1
	Arrival Time: 2
	Burst Time: 6
	Priority: 7

	Process Name: P2
	Arrival Time: 1
	Burst Time: 8
	Priority: 1
	/*
	sample run:
	./measure-run-time < source-input.txt

	output:
	2
	4
	100

	elapsed time: 0.523ms
	#include <iostream>
	#include <functional>
	#include <deque>
	#include <vector>

	using namespace std;

	template<typename T>
	deque<T> find_lis(const vector<T> &a,
	function<bool(const T &, const T &)> comp = [&](const T &a, const T &b)->bool { return a < b; })
	#include <iostream>
	#include <vector>
	#include <climits>
	#include <algorithm>

	using namespace std;

	vector<int> rc;

	int B(int i, int j)
	#include "csv.h"
	#include <fstream>
	#include <sstream>
	#include <stdexcept>

	Csv::Csv(const string &dir)
	{
	directory = dir;
	read(dir);
	}