Оптимизировать алгоритм

#include <string>
#include <vector>
std::string who_is_next(std::vector<std::string> &names, long long r) {
for (int i = r;; --i) {
if (i == 1)  { return names[0]; }
else{ names.vector::push_back(names[0]); names.vector::push_back(names[0]);names.erase(names.begin());}}}

std::vector<std::string> names = {"Sheldon", "Leonard", "Penny", "Rajesh", "Howard"};  
        Assert::That(who_is_next(names, 1), Equals("Sheldon"));
        Assert::That(who_is_next(names, 52), Equals("Penny"));
        Assert::That(who_is_next(names, 10010), Equals("Howard"));

string[] names = new string[] { "Sheldon", "Leonard", "Penny", "Rajesh", "Howard" };
Line.WhoIsNext(names, 1) == "Sheldon"
Line.WhoIsNext(names, 52) == "Penny"
Line.WhoIsNext(names, 7230702951) == "Leonard"

auto item = std::move(names[0]);
names.erase(names.begin());
names.push_back(item);
names.push_back(std::move(item));

std::string who_is_next(std::vector<std::string> &names, long long r) 
{
    names.reserve(names.size() + r * 2);
    
    size_t i = 0;
    for (; i < r; ++i)
    {
        auto item = std::move(names[i]);
        names.emplace_back(item);
        names.emplace_back(std::move(item));
    }
 
    names.erase(names.begin(), names.begin() + i);
    return names[0];
}

Assert::That(who_is_next(names, 10010), Equals("Howard"));