Sleep Sorting in Python, using Threads
In , an unusual, fun sorting algorithm, called ‘Bogo’, is demonstrated using Python. This article, which introduces another famous sorting algorithm, which may be just for fun only. The …
Category: algorithms
Finding Primes
A prime number is a positive natural number that is greater than 1 and no other divisors other than 1 and itself. For example, 2, 3, 5 are primes …
O(n) High-precision Division Between Two Integers
July 2, 2012
algorithms, beginner, brute force, code, implementation, math, programming languages, python, technical, tricks
No Comments
This article will describe a quick and easy implementation of a algorithm that divides two integers with a high precision. Normally, an array is required to hold the results …
GCD and LCM
July 1, 2012
algorithms, beginner, code, code library, implementation, interview questions, math, programming languages, python, technical
No Comments
GCD (Greatest Common Divisor), in mathematics, is refered to the largest number that divides two or more non-zero integers without a remainder. For example, the GCD of 8 and …
Codeforces: C. Letter
The problem is from codeforces: http://codeforces.com/problemset/problem/180/C Let n be the number of lower-cases that have encountered so far from left to right; So everytime there is an uppercase letter, …