Create smallestRange.py

greedy_methods/smallestrange.py

@@ -1,3 +1,10 @@
+"""
+ smallest_range function takes a list of sorted integer lists and
+ finds the smallest range that includes at least one number from each list, 
+ using a min heap for efficiency.
+"""
+
+
 import doctest
 import heapq
 import sys