Prime Number Finder

Write a Python function called find$\_$primes that takes two integers, start and end, as input and returns a list of all prime numbers between start and end $($inclusive$).$ A prime number is a natural number greater than $1$ that has no positive divisors other than $1$ and itself. Your function should also handle the case where start is less than $2$ by starting the search from $2.$ If start is greater than end, return an empty list.