Scheduled stopping and starting an AWS instanceĬloudera CDH5 - Scheduled stopping and starting services Uploading a big file to AWS S3 using boto module Simple tool - Google page ranking by keywords Python Unit Test - TDD using unittest.TestCase class Image processing with Python image library Pillow Python Network Programming IV - Asynchronous Request Handling : ThreadingMixIn and ForkingMixIn Python Network Programming III - Echo Server using socketserver network framework Python Network Programming II - Chat Server / Client Python Network Programming I - Basic Server / Client : B File Transfer Python Network Programming I - Basic Server / Client : A Basics REST API : Http Requests for Humans with Flask Web scraping with Selenium for checking domain availability Python HTTP Web Services - urllib, httplib2 MongoDB with PyMongo I - Installing MongoDB. Connecting to DB, create/drop table, and insert data into a table Priority queue and heap queue data structure Python Object Serialization - yaml and json Python Object Serialization - pickle and json Sets (union/intersection) and itertools - Jaccard coefficient and shingling to check plagiarismĬlasses and Instances (_init_, _call_, etc.)īits, bytes, bitstring, and constBitStream Strings - Escape Sequence, Raw String, and Slicingįormatting Strings - expressions and method calls Object Types - Numbers, Strings, and None Running Python Programs (os, sys, import)
The interesting property of a heap is that its smallest element is always the root, $heap\left$. For the sake of comparison, non-existing elements are considered to be infinite.
This implementation uses arrays for which $heap\left \le heap\left$ and $heap\left \le heap\left$ for all $k$, counting elements from zero. Heaps are binary trees for which every parent node has a value less than or equal to any of its children. This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm.
The heapq implements a min-heap sort algorithm suitable for use with Python's lists.
0 kommentar(er)
