NathanEpstein

library(fGarch)
skew_plot = function(skewParam = 1, std=1, color = 'black', xmin = -5, xmax = 5) {
  x <- seq(xmin, xmax, length = 200)
  y <- dsnorm(x, sd=std, xi = skewParam)
  plot(x, y, type = 'l', col = color)
}

add_line = function(skewParam = 1, std=1, color = 'black', xmin = -5, xmax = 5) {
  x <- seq(xmin, xmax, length = 200)
  y <- dsnorm(x, sd=std, xi = skewParam)

NathanEpstein

def insertion_sort(array)
  for i in 1..array.length-1
    j = i
    while j > 0 && array[j-1] > array[j]
      pivot = array[j]
      array[j] = array[j-1]
      array[j-1] = pivot
      j -= 1
    end
  end

NathanEpstein

function insertSort(arr){
  for (var i=1;i<arr.length;i++){
    var j = i;
    while ((j > 0) && (arr[j-1] > arr[j])){
      var pivot = arr[j];
      arr[j] = arr[j-1];
      arr[j-1] = pivot;
      j -= 1;
    }
  }

NathanEpstein

def boxMuller()
  u1, u2 = rand, rand
  z1 = Math.sqrt(- 2 * Math.log(u1)) * Math.cos(2 * u2 * Math::PI)
  z2 = Math.sqrt(- 2 * Math.log(u1)) * Math.sin(2 * u2 * Math::PI)
  [z1,z2]
end

NathanEpstein

// Data Source: http://vincentarelbundock.github.io/Rdatasets/csv/cluster/votes.repub.csv

var data = {
'Alabama':{'X1968': '14', 'X1856': 'NA', 'X1876': '40.02', 'X1872': '53.19', 'X1912': '8.26', 'X1916': '21.97', 'X1964': '69.5', 'X1976': '43.48', 'X1896': '28.13', 'X1972': '72.4', 'X1892': '3.95', 'X1932': '14.15', 'X1956': '39.39', 'X1936': '12.82', 'X1952': '35.02', 'X1868': '51.44', 'X1860': 'NA', 'X1864': 'NA', 'X1904': '20.65', 'X1900': '34.67', 'X1908': '24.38', 'X1928': '48.49', 'X1884': '38.44', 'X1940': '14.34', 'X1960': '41.75', 'X1880': '36.98', 'X1944': '18.2', 'X1920': '30.98', 'X1948': '19.04', 'X1924': '27.01', 'X1888': '32.28'}
,
'Alaska': {'X1968': '45.3', 'X1856': 'NA', 'X1876': 'NA', 'X1872': 'NA', 'X1912': 'NA', 'X1916': 'NA', 'X1964': '34.1', 'X1976': '62.91', 'X1896': 'NA', 'X1972': '58.1', 'X1892': 'NA', 'X1932': 'NA', 'X1956': 'NA', 'X1936': 'NA', 'X1952': 'NA', 'X1868': 'NA', 'X1860': 'NA', 'X1864': 'NA', 'X1904': 'NA', 'X1900': 'NA', 'X1908': 'NA', 'X1928': 'NA', 'X1884': 'NA', '

NathanEpstein

#include <iostream>
#include <math.h>
#include <vector>

using namespace std;

void qsort(vector<int>& v){
  if (v.size() > 1){
    int pivot = floor(v.size()/2);
    vector<int> left;

NathanEpstein

#include <vector>
#include <math.h>
#include <iostream>

using namespace std;

//get the index of a target integer from a sorted vector
int binSearch(const vector<int>& sorted, const int target){
  const int mid = floor(sorted.size()/2);

NathanEpstein

#include <list>
#include <iostream>

using namespace std;

// Implement Q class
class Q{
public:
  Q();
  ~Q();

NathanEpstein

#include <vector>
#include <math.h>
#include <iostream>

using namespace std;

//BUBBLE SORT IMPLEMENTATION
vector<double> bubbleSort(vector<double> arr){
  bool pass = false; //have we passed through the array without a swap?
  double temp;

NathanEpstein

bubbleSort = function(array){
  var swaps = 0;
  var comparisions = 0;
  var bool = true;

  if (array.length <= 1){
    bool = false;
    return array;
  }