Assuming the list of IDs isn’t too large, you could convert the QS to a list and sort it in Python: album_list = list(albums) album_list.sort(key=lambda album: album_ids.index(album.id))
Heap sort unstable example Consider array 21 20a 20b 12 11 8 7 (already in max-heap format) here 20a = 20b just to differentiate the order we represent them as 20a and 20b While heapsort first 21 is removed and placed in the last index then 20a is removed and placed in last but one … Read more
As of ES2019, sort is required to be stable. In ECMAScript 1st edition through ES2018, it was allowed to be unstable. Simple test case (ignore the heading, second set of numbers should be sequential if the engine’s sort is stable). Note: This test case doesn’t work for some versions of Chrome (technically, of V8) that … Read more
Yes, the intention of the manual is indeed to guarantee that sorted is stable and indeed that it uses exactly the same algorithm as the sort method. I do realize that the docs aren’t 100% clear about this identity; doc patches are always happily accepted!