query: Why is selection sort faster than bubble sort?
positive_passages.docid: 1889
positive_passages.text: How do I write a correct micro-benchmark in Java?
negative_passages.docid: 128065
negative_passages.text: Bubble Sort Homework
negative_passages.docid: 29863
negative_passages.text: Sorting a vector of objects
negative_passages.docid: 46191
negative_passages.text: How does sort function work in JavaScript, along with compare function
negative_passages.docid: 142971
negative_passages.text: Difference between Sort and SortBy
negative_passages.docid: 57211
negative_passages.text: Is "else if" faster than "switch() case"?
negative_passages.docid: 97398
negative_passages.text: Is < faster than <=?
negative_passages.docid: 152979
negative_passages.text: Is python's sorted() function guaranteed to be stable?
negative_passages.docid: 66761
negative_passages.text: Is it costly to do array.length or list.count in a loop
negative_passages.docid: 60543
negative_passages.text: Which sort algorithm works best on mostly sorted data?
negative_passages.docid: 98432
negative_passages.text: Simpler way of sorting three numbers
negative_passages.docid: 49757
negative_passages.text: Is using double faster than float?
negative_passages.docid: 118032
negative_passages.text: case-insensitive alphabetical sorting of nested lists
negative_passages.docid: 120986
negative_passages.text: Strange default sort behaviour
negative_passages.docid: 51151
negative_passages.text: Javascript Array.sort implementation?
negative_passages.docid: 52432
negative_passages.text: Sorting in JavaScript: Shouldn't returning a boolean be enough for a comparison function?
negative_passages.docid: 35697
negative_passages.text: Performance of Arrays vs. Lists