Would this method be efficient at finding string permuations

#include <iostream> 
#include <string>
using namespace std; 
int main()
{
    string word;
    cin>>word; 
    int s = word.size();
    string original_word = word; 
    do
    {          
        for(decltype(s) i =1; i!= s;++i){
            auto temp =word[i-1]; 
            word[i-1] = word[i];
            word[i] = temp; 
            cout<<word<<endl; 
        }
    }while(word!=original_word); 
}

Is this solution efficient and how does it compare by doing this recursively?