Sir how can i optimize this code more

#1

#include

using namespace std;

int main() {

int Number,column;

cin>>Number;

for(int row=1;row<=Number;row++)

{

	for(column=1;column<=row;column++)

	{

		cout<<column<<"	";

	}

	for(int space=1;space<=(2*Number-

(2*row))-1;space++)

	{

		cout<<"	";

	}

	column=column-1;

	if(row==Number)

	{

		column=column-1;

		while(column>=1)

		{

			cout<<column<<"	";

			column--;

		}

	}

	else

	{

		while(column>=1)

		{

			cout<<column<<"	";

			column--;

		}

		cout<<endl;

	}

}

return 0;

}

#2

hello @tejasddongare
ur logic is already optimised , we cannot optimise it furthur

#3

sir we can optimize it more
#include
using namespace std;
int main() {
int Number,column;
cin>>Number;
for(int row=1;row<=Number;row++)
{
for(column=1;column<=row;column++)
{
if(column!=Number)
cout<<column<<" “;
}
for(int space=1;space<=(2Number-(2row))-1;space++)
{
cout<<” “;
}
column=column-1;
while(column>=1)
{
cout<<column<<” ";
column–;
}
cout<<endl;
}
return 0;
}

#4

this one is also has quadratic time complexity