Skip to content

Instantly share code, notes, and snippets.

View nasturtus's full-sized avatar

Santosh.S.N nasturtus

3 followers · 9 following
  • Singapore
View GitHub Profile
@nasturtus
nasturtus / priority_queues.py
Created May 11, 2017 03:59
# Priority Queues
# From: https://dbader.org/blog/priority-queues-in-python
# Sorted list
sl = []
sl.append((3, 'Sleep'))
sl.append((1, 'Eat'))
sl.append((2, 'Code'))
sl.sort(reverse=True)
@nasturtus
nasturtus / circle.py
Created May 4, 2017 03:06
# http://greenteapress.com/thinkpython2/html/thinkpython2005.html
import turtle
import math
def polygon(t, n, length):
angle = 360 / n
print(angle)
for i in range(n):
@nasturtus
nasturtus / polygon.py
Created May 3, 2017 03:48
# http://greenteapress.com/thinkpython2/html/thinkpython2005.html
import turtle
def polygon(t, n, length):
angle = 360 / n
for i in range(n):
t.fd(length)
t.lt(angle)
@nasturtus
nasturtus / timeit.py
Created April 20, 2017 18:56
# Illustrate timeit to time code snippets.
import timeit
# timeit should be callable and requires two arguments:
# a string and number of iterations.
# A basic timeit
print(timeit.timeit('10 + 2', number=1000000))
@nasturtus
nasturtus / webserver.txt
Created April 20, 2017 18:37
# Start a webserver in a jiffy.
Run python -m http.server 8000 from the directory containing index.html
Open browser window and enter localhost:8000 on the address bar to open index.html
@nasturtus
nasturtus / generator_list.py
Last active May 2, 2017 03:53
# Generators vs List Comprehension
# References:
# 1. https://pythonprogramming.net/list-comprehension-generators-intermediate-python-tutorial/
# 2. The following is from reuven@lerner.co.il:
# That's why using a generator expression, which acts as an iterator, is often such an attractive option in Python:
# Rather than waiting for the entire thing to execute, and then returning a large list, we return the instructions
# that create a new list. In doing so, we save memory and execution time, allowing x to get something back faster.
# The fact that creating a generator expression is often just a matter of replacing the square brackets ( '[' and ']' )
# with regular parentheses ( '(' and ')' ) makes it a no-brainer in many situations.
@nasturtus
nasturtus / zip_it_up.py
Created April 18, 2017 00:16
# Zip it up!
# Reference:
# https://pythonprogramming.net/list-comprehension-generators-intermediate-python-tutorial/
a = [10, 20, 30]
b = [40, 50, 60]
print(zip(a, b))
print(list(zip(a, b)))
@nasturtus
nasturtus / idempotence.py
Created April 17, 2017 23:20
# Illustrating idemptotence
# An operation is idempotent if f(x) => n, f(f(x)) => n, f(f(f(x))) => n ..
# Reference:
# Corey Schafer https://www.youtube.com/watch?v=UaKZ4wKytcA
# The following is not idempotent since the results from square(n)
# and square(square(n)) differ.
def square(n):
@nasturtus
nasturtus / str_repr_type.py
Created April 17, 2017 04:37
# The goal of str() is readbility.
# The goal of repr() is to be unambiguous.
# The goal of type() is, well..to display the type.
# Reference: Corey Schafer https://www.youtube.com/watch?v=5cvM-crlDvg
from datetime import datetime
a = datetime.now()
print(str(a))
@nasturtus
nasturtus / decorator4.py
Created April 16, 2017 09:19
# Decorator without arguments
def decorator_function(func):
def wrapper_function(*args, **kwargs):
print("Before function: {}".format(func.__name__))
return func(*args, **kwargs)
return wrapper_function
@decorator_function
def greeting(name, greeting):