query: vector sorting on the basis of first only
positive_passages.docid: 6729
positive_passages.text: How do I sort a vector of pairs based on the second element of the pair?
negative_passages.docid: 97908
negative_passages.text: Finding the no. of possible matrices given the order and limited no. of entries
negative_passages.docid: 102410
negative_passages.text: Ways of merging two incomparable sorted lists of elements keeping their relative ordering
negative_passages.docid: 16844
negative_passages.text: Sort strings by natural ordering
negative_passages.docid: 85023
negative_passages.text: Permutation of n objects with restriction of adjacent pairs
negative_passages.docid: 83668
negative_passages.text: How to remove duplicates from unsorted std::vector while keeping the original ordering using algorithms?
negative_passages.docid: 60543
negative_passages.text: Which sort algorithm works best on mostly sorted data?
negative_passages.docid: 7396
negative_passages.text: Unique representation of a vector
negative_passages.docid: 24431
negative_passages.text: Erasing elements from a vector
negative_passages.docid: 98432
negative_passages.text: Simpler way of sorting three numbers
negative_passages.docid: 152979
negative_passages.text: Is python's sorted() function guaranteed to be stable?
negative_passages.docid: 117248
negative_passages.text: Sort rows in a matrix with a vector
negative_passages.docid: 63443
negative_passages.text: What's the 'Frequent' sort function?
negative_passages.docid: 152249
negative_passages.text: Sorted collection in Java
negative_passages.docid: 121777
negative_passages.text: How to sort a vector containing const values
negative_passages.docid: 54489
negative_passages.text: Sort by distance
negative_passages.docid: 81280
negative_passages.text: Why doesn't **sort** sort the same on every machine?