query: A sorted container in python based on comparisons
positive_passages.docid: 28580
positive_passages.text: Is there a module for balanced binary tree in Python's standard library?
negative_passages.docid: 37359
negative_passages.text: Sorting a vector of custom objects
negative_passages.docid: 108307
negative_passages.text: How do I sort a generic list using a custom comparer?
negative_passages.docid: 95798
negative_passages.text: Compare object instances for equality by their attributes
negative_passages.docid: 58543
negative_passages.text: Sorting a list with secondary criterion
negative_passages.docid: 147508
negative_passages.text: Ordinal trends and finding concordant and discordant pairs
negative_passages.docid: 60543
negative_passages.text: Which sort algorithm works best on mostly sorted data?
negative_passages.docid: 116631
negative_passages.text: How to get indices of a sorted array in Python
negative_passages.docid: 69840
negative_passages.text: Function to sort a static list of items by recency and frequency
negative_passages.docid: 69110
negative_passages.text: Sorting a Dictionary by Value
negative_passages.docid: 108888
negative_passages.text: What is the fastest way to compare two sets in Java?
negative_passages.docid: 152573
negative_passages.text: Comparison-based ranking algorithm
negative_passages.docid: 117025
negative_passages.text: Selection algorithms on sorted matrix
negative_passages.docid: 41473
negative_passages.text: How to sort a Python dict's keys by value
negative_passages.docid: 146601
negative_passages.text: Comparing two objects .
negative_passages.docid: 51090
negative_passages.text: Sorting sub-lists into new sub-lists based on common first items
negative_passages.docid: 133558
negative_passages.text: How to pick one number from each sorted list so that the difference between the minimum and maximum is as small as possible?