Finding Divisors - Implementation

Here is pseudocode to find all divisors of n:

function findDivisors(n):
  divisors = []
  for i from 1 to sqrt(n):
    if n % i == 0:
      divisors.append(i)
      if i != n / i:  # avoid duplicates for perfect squares
        divisors.append(n / i)
  return divisors

Time complexity: O(√n). For n = 100, you check 10 values instead of 100.