query: How do python define builtin sorted( ) two same elements
positive_passages.docid: 152979
positive_passages.text: Is python's sorted() function guaranteed to be stable?
negative_passages.docid: 112915
negative_passages.text: is it possible to do quicksort of a list with only one passing?
negative_passages.docid: 37426
negative_passages.text: Select in union of sorted arrays: Already known?
negative_passages.docid: 26669
negative_passages.text: Is there a built in function for string natural sort?
negative_passages.docid: 69110
negative_passages.text: Sorting a Dictionary by Value
negative_passages.docid: 50792
negative_passages.text: In Python, what is the difference between ".append()" and "+= []"?
negative_passages.docid: 5425
negative_passages.text: Natural Sort Order in C#
negative_passages.docid: 116631
negative_passages.text: How to get indices of a sorted array in Python
negative_passages.docid: 96210
negative_passages.text: Equivalent of Numpy.argsort() in basic python?
negative_passages.docid: 70839
negative_passages.text: Standard library sort and user defined types
negative_passages.docid: 126408
negative_passages.text: Why does this sort ignore the +/- character prefix?
negative_passages.docid: 146011
negative_passages.text: How to sort alpha numeric set in python
negative_passages.docid: 71298
negative_passages.text: Pythonic way to check if a list is sorted or not
negative_passages.docid: 83616
negative_passages.text: How can I sort a dictionary by key?
negative_passages.docid: 41473
negative_passages.text: How to sort a Python dict's keys by value
negative_passages.docid: 72137
negative_passages.text: Sorting dynamically allocated strings
negative_passages.docid: 85321
negative_passages.text: Why does this quick sort cause stack overflow on nearly sorted lists and sorted lists?