Learning DataStructures and Algorithms using python 2.7
- Finding greatest common divisor (GCD) of two integers (m,n)
- Largest K that divides m and n (starting from naive way and improving using euclid"s algorithm which works for larger numbers too)
- searching and sorting