Given a positive integer n, return every divisor of n — every integer from 1 to n that divides it with no remainder — sorted in ascending order. Divisors always come in pairs: if i divides n, so does n / i. That pairing means you never need to test anything past √n — for every small divisor found on the way up, its larger partner is found for free, without ever touching it directly.