[Solved] Why does sort_by often perform faster than sort with a block for complex sorting? — Ans: Because sort_by computes keys once before sorting | Ruby

Ruby - Enumerable and Collection Processing

Why does sort_by often perform faster than sort with a block for complex sorting?

ABecause <code>sort_by</code> only works on numbers

BBecause <code>sort_by</code> computes keys once before sorting

CBecause <code>sort_by</code> modifies the original array in place

DBecause <code>sort_by</code> uses parallel processing internally

Step-by-Step Solution

Solution:

Step 1: Understand how sort_by works internally
sort_by creates an array of keys by applying the block once per element.
Step 2: Compare with sort with block
sort with block compares elements multiple times, recalculating keys repeatedly.
Final Answer:
Because sort_by computes keys once before sorting -> Option B
Quick Check:
Key computation optimization = Because sort_by computes keys once before sorting [OK]

Quick Trick: sort_by caches keys, making sorting faster for complex keys [OK]

Common Mistakes:

Master "Enumerable and Collection Processing" in Ruby

9 interactive learning modes - each teaches the same concept differently

More Ruby Quizzes

Why does sort_by often perform faster than sort with a block for complex sorting?