Fast select 1.0

Fast select 1.0 Download Summary

  • Language: Python
  • Platform: Windows / Linux / Mac OS / BSD / Solaris
  • License: Other Free / Open Source License - Python License
  • Databases: N/A
  • Downloads: 369
  • Released: Jun 7, 2007

Fast select 1.0 Description

This script allows you to quickly select the n-th rank ordered element of a given sequence. It modifies the ordering of the given sequence.

Fast select Bookmark

Hyperlink code:
Hyperlink for Forum code:

Fast select 1.0 Script Download Notice

Top 4 Download periodically updates information of Fast select 1.0 script from the developer, but some information may be slightly out-of-date.

Our script download links are directly from our mirrors or publisher's website. Fast select 1.0 torrent files or shared files from free file sharing and free upload services, including Rapidshare, MegaUpload, YouSendIt, MailBigFile, DropSend, HellShare, HotFile, FileServe, MediaMax, zUpload, MyOtherDrive, SendSpace, DepositFiles, Letitbit, LeapFile, DivShare or MediaFire, are not allowed!

Splitting up a sequence

This script allows you to split up a sequence in same-size (if possible) parts. ...
Python

Remove duplicates from a sequence

The fastest way to remove duplicates from a sequence depends on some pretty subtle properties of the sequence elements, such as whether they're hashable, and whether they ... script defines the unique() function that tries three methods, from fastest to slowest, letting runtime exceptions pick the best method available for the sequence at hand. ...
Python

Fifo as single linked lists

... First Out". This script  creates a container, which only allows element insertion and removal and where the first element inserted is the first element removed. ...
Python

Implementation of sets using sorted lists

... a dictionary based implementation. - Flexibility -- elements do not need to be hashable, only __cmp__ is required. - Fast operations depending on the underlying data patterns. ... get united, intersected, or differenced with only log(N) element comparisons.Results are built using fast-slicing. - Algorithms are designed to minimize the ...
Python

Sieve of Eratosthenes

This script computes an infinite sequence of primes using simple generators. A Python dictionary is used to mark multiples of the generated primes, according to the Sieve of Eratosthenes. ...
Python