Describe an algorithm that takes two inputs: a list of m numbers and an integer n (n <= m), and returns the nth smallest element in the list. No program required.

Explain please