Compare two unsorted std::vector

What is the best way to compare two unsorted std::vector

std::vector<int> v1 = {1, 2, 3, 4, 5};
std::vector<int> v2 = {2, 3, 4, 5, 1};

What I am currently doing is

const auto is_similar = v1.size() == v2.size() && std::is_permutation(v1.begin(), v1.end(), v2.begin());

Here two vectors are similar only when the size of both vectors are equal and they contain the same elements

What would be a better approach for

• two small std::vectors (size well under 50 elements)
• two large std::vectors