Next permutation.... the question is showing TLE

#1

#include
#include
using namespace std;
int main() {
int t;
cin>>t;
while(t)
{
int n;
cin>>n;
int a[n];
for (int i=0;i<n;i++)
{
cin>>a[i];
}

	if (next_permutation(a,a+n))
	{
		for (int x:a)
		{
			cout<<x<<" ";
		}
	}
	else
	{
		sort(a,a+n);
		for(int i=0;i<n;i++)
		{
			cout<<a[i]<<" ";
		}
	}
	cout<<endl;
}
return 0;

}

HOW CAN I OPTIMIZE THIS SOLUTION??

#2

you forgot to decrease t
so it run infinite loop and hence gives tle

after decreasing t code will pass all testcases

i hope this help
if you have more doubts regarding this feel free to ask
if your doubt is resolved mark it as resolved from your doubt section inside your course

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.