On Dec 15, 10:00 pm, "cmdrrickhun...@yaho.com"
wrote:
> It can be proven that you cannot sort an arbitrarily large set of
> numbers, given no extra information, faster than O(n log n).
Cormen Leiserson and Rivest, "Algorithms", have a short clear chapter
on
"Sorting in linear time":
" ... cou
> > A quick fix is to replace line 1854 in pydoc.py (ModuleScanner.run) with
> > this one:
>
> > for importer, modname, ispkg in
> > pkgutil.walk_packages(onerror=lambda name:None):
>
> > (the onerror argument makes it to ignore all errors)
well not all, for example
GLUT: Fatal Err
