goyalankit

#
# Run: ruby kendall_tau_distance.rb <filename1> <filename2>
# Given two files with values sorted according to their rank. Calcultae the KendallTau distance.
# This program considers all possible permuations of the given set, not scalable for a large set.
#
# Link to this file: https://gist.github.com/goyalankit/6755852

if ARGV.length < 2
  p "please provide two files sorted based on rank values"
  p "Usage: ruby kendall_tau_distance.rb <filename1> <filename2> "

goyalankit

#include<iostream>
#include<vector>
#include<fstream>
#include<cmath>
#include<cstdlib>
#include <algorithm>


using namespace std;

goyalankit

#include<iostream>
#include<algorithm>

using namespace std;

int main(int argc, char **argv){

    int list[9] = {10, -1, 5, 6, 20, -50, 100, -100, 4};

    int current_maximum = 0, previous_maximum=0;

goyalankit

/*
*Author: Ankit Goyal
*Date: 10/12/2013
*
*sample input:
* 2
* hello
* ankitg
*
* output:

goyalankit

#
# Author: Ankit Goyal
# Date: 10/26/2013
# Spiral Matrix Traversal
#

class SpiralMatrixTraversal

    def initialize n, m, y_start, x_start
        @first  = n

goyalankit

# Found on the ZshWiki
#  http://zshwiki.org/home/config/prompt
#
# Author: Ankit Goyal @_goyalankit
#
#Mimalistic Version(2 lines)
#PROMPT="%{$fg[red]%}%%%{$reset_color%} "
#RPROMPT='${time} %{$fg[cyan]%}%c%{$reset_color%}%{$reset_color%}'

grey='\e[0;90m'

goyalankit

#include<iostream>
#include<regex>
#include<string>

int main(void){
    std::string num = "-23.43";

     if (std::regex_match (num, std::regex("^[+|-]{0,1}(\\d)*\\.?\\d+$") ))
         std::cout << "it's a number" << std::endl;
     else

goyalankit

#y procedure calculates the frequency of each character in the string
y = Proc.new{|x| x.chars.group_by{|i| i}.values.collect{|i| i.count}}

z = Proc.new{|m,n| y.call(m) == y.call(n)}

z.call("foo", "app")


#the one liner, less readable..:) well technically two to make it general
y = Proc.new{|m,n| m.chars.group_by{|i| i}.values.collect{|i| i.count} == n.chars.group_by{|i| i}.values.collect{|i| i.count} }

goyalankit

class BinaryTree
    attr_accessor :left, :right, :data

    def initialize data
        @data = data
    end

    def self.create_tree
        root = BinaryTree.new(3)
        root.left = BinaryTree.new(9)

goyalankit

5 5
0 .1667 1 .1667 2 .1667 3 .1667
2 .5 3 .3333 4 1
0 .333 1 0.1667 2 0.6667 3 0.333
1 .3333 2 .8333 3 .3333 4 .1667
0 .5 1 .1667 2 .1667 3 .1667