If the sort key comes from a lookup into the other feed, comparing() pays for that lookup O(n log n) times, not n times. Extract once into a pair and sort the pairs - the decorate-sort-undecorate that Comparator.comparing looks like but is not.
Run this yourself in the Online Java Compiler, spin up a live REST API in the API Sandbox, or practise with Java interview questions.
Published 2026-09-20