Skip to content

Instantly share code, notes, and snippets.

View shashank31mar's full-sized avatar

Shashank Gupta shashank31mar

  • Amadeus Labs
  • India
View GitHub Profile
@shashank31mar
shashank31mar / gist:d014d9ded43210f158ae5aa318257b6f
Created December 14, 2016 05:37 — forked from ttezel/gist:4138642
Natural Language Processing Notes

#A Collection of NLP notes

##N-grams

###Calculating unigram probabilities:

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

In english..

@shashank31mar
shashank31mar / chess.py
Created June 14, 2018 01:00 — forked from rsheldiii/chess.py
chess program for python
"""CONVENTIONS:
positions are done row-column from the bottom left and are both numbers. This corresponds to the alpha-number system in traditional chess while being computationally useful. they are specified as tuples
"""
import itertools
WHITE = "white"
BLACK = "black"
@shashank31mar
shashank31mar / complexitypython.txt
Created June 15, 2018 03:01 — forked from Gr1N/complexitypython.txt
Complexity of Python Operations
Complexity of Python Operations
In this lecture we will learn the complexity classes of various operations on
Python data types. Then we wil learn how to combine these complexity classes to
compute the complexity class of all the code in a function, and therefore the
complexity class of the function. This is called "static" analysis, because we
do not need to run any code to perform it.
------------------------------------------------------------------------------