A Faster Exponentiation Algorithm by Squaring (Power Function)
If we want to compute , we can have a naive implementation by multiplication of base number x. def pow(x, n): r = 1 for _ in xrange(n): r *= …
GCD, Greatest Common Divisor
December 17, 2012
algorithms, beginner, implementation, math, programming languages, recursive
No Comments
In , the GCD (Greatest Common Divisor) is given in brief details. The algorithm can be implemented in both recursive and iterative forms. The recursive formula is , and …
Codeforces: A. System Administrator
December 7, 2012
beginner, codeforces, implementation, math, programming languages, python
No Comments
The problem is from codeforces: http://codeforces.com/problemset/problem/245/A A really simple math problem, can be solved within a few lines of Python code: #!/usr/bin/env python ax = asum = 0 bx = …
Quick Demonstration of Quick Sort in Python
December 1, 2012
algorithms, code, code library, implementation, programming languages, python, recursive, sorting
4 Comments
Quick Sort is a comparison sorting method, on average, the complexity is . In worst cases, e.g. when the array of elements are already sorted, it is degraded into …
Codeforces: B. Internet Address
November 30, 2012
algorithms, beginner, brute force, codeforces, implementation, programming languages, python, string
No Comments
The problem is from codeforces: http://www.codeforces.com/problemset/problem/245/B It is an easy string-matching related problem. You can have many ways to solve this. Because of the limitation, i.e. the first letter must …
Faster PI Computation
November 30, 2012
algorithms, beginner, implementation, math, programming languages, python
No Comments
In , two equations are used and compare the efficiency of computation of the math constant . The following are some commonly-used equations to compute the We pick the …