This script allows you to manage data collections.For random data, this implementation still makes more comparisons than a sort using heapq or the builtin sort.
For partially ordered data, it can perform better than the builtin sort. Because of the list of lists data structure, it always takes more memory than either heapq or the builtin sort.
Top 4 Download periodically updates information of Two-pass Pairing Heap with Auxiliary List 1.3 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. Two-pass Pairing Heap with Auxiliary List 1.3 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!