ttezel

function quickSort (arr) {
  if (!arr.length)
    return arr

  var pivot = arr.splice(0, 1)
  var less = []
  var greater = []

  arr.forEach(function (el) {
    if (el <= pivot)

ttezel

#Some things I think will happen by 2020:

1. The Voice interface will be mastered. We will be talking to computers and they will understand the meaning/context of our words, and help us live our lives. Siri is where it starts.

2. Fully articulable, brain-controlled artificial limbs will be in existence. Amputees will have limbs replaced with an artificial limb, and continue to live fully enabled. Price would still be high at this time. There is already great progress in this area.

3. Driverless cars will start to gain popularity. People who purchase an autonomous vehicle (e.g. Google's driverless car) will be sitting in their cars, working/entertaining themselves with mobile devices while they are driven around. Google is close to launching their autonomous car for sale. They are way ahead of the competition. Google will be heavy in the automotive game. They are lobbying to legalize Autonomous Vehicles in the US.

4. We will have devices with morphable, touchable interface

ttezel

#A Collection of NLP notes

##N-grams

###Calculating unigram probabilities:

P( w_i ) = count ( w_i ) ) / count ( total number of words )

In english..

ttezel

var script = document.createElement('script');
script.src = 'https://code.jquery.com/jquery.min.js';
script.type = 'text/javascript';
document.getElementsByTagName('head')[0].appendChild(script);

ttezel

/**
 * Given an array of real numbers,
 * returns  the max contiguous subsequence for which 
 * the sum of the elements is maximized
 * 
 * @param  {Array} arr  input array
 * @return {Array}      slice with maximum sum
 */
function maxSubarray (arr) {
    //start & end indices for our max slice

ttezel

#Class #2 Wed. Jan 9, 2013

End of last class

f = O(g) if there exist constants c and N s.t.

(notation: ∀ === for all)

f(n) ≤ g(n) ∀ n ≥ N

ttezel

%{
    Problem 7 (i): modexp function
    Returns x ^ y mod n for x, y, and n > 1.
%}
function result = modexp (x, y, n)
    %anything raised to 0th power = 1 so return 1
    if (y == 0)
        result = 1;
        return;
    end

ttezel

%{
    Problem 7 (ii) - extended-euclid function

    Given two integers a and b, it finds the largest integer that 
    divides both of them - known as their greatest common divisor (gcd).

    Input: integers a and b where a >= b >= 0
    Output : gcd(a, b)
%}
function result = euclid (a, b)

ttezel

%{
    Problem 7 (ii) - Extended Euclid

    Input:  positive integers a,b with a >= b >= 0
    Output: integer array [ x,y,d ] such that 
            d = gcd(a,b) and ax + by = d
%}
function result = extended_Euclid (a, b)

    if (b == 0)

ttezel

curl -XPOST 'http://localhost:9200/fuzzytest/' -d '
{
  settings: {
    index: {
        analysis: {
            analyzer: {
                default: {
                    type: "custom",
                    tokenizer: "uax_url_email",
                    filter: [ "lowercase" ]