RejectedTechnical Screen

25-Minute Screen, Sorting Complexity and Cache Review, Rejected

MercorSoftware Engineer · Technical Screen · Aug 2026

Sorting Complexity They asked me to come up with a sorting algorithm that is as inefficient as possible and explain its time complexity. One idea is to enumerate all permutations of n distinct elements and check one by one whether each is sorted. There are n! permutations in total and each check takes O(n), so the worst-case time complexity can reach O(n × n!). Strictly speaking there is no singl…

Shared by a candidate · reported Aug 2026. Interview formats change; use it as a guide, not a script.