if

if (num1>num2&&num1>num3&&num1>num4&&num1>num5)

largest=num1;

if (num2>num1&&num2>num3&&num2>num4&&num2>num5)

largest=num2;

if (num3>num1&&num3>num2&&num3>num4&&num3>num5)

largest=num3;

if (num4>num1&&num4>num2&&num4>num3&&num4>num5)

largest=num4;

if (num5>num1&&num5>num2&&num5>num3&&num5>num4)

largest=num5;

cout<<"The largest is "<<largest<<"."<<endl;

if (num1 > num2)

largest = num1;

else

largest = num2;

if (num3 > largest)

largest = num3;

if (num4 > largest)

largest = num4;

if (num5 > largest)

largest = num5;

cout<<"The largest is "<<largest<<"."<<endl;

Analyze the above two methods to decide which method is faster and explain the reasons.
If extend the number to n instead of 5, what will be total running time for each method?
Is O(n) or O(n²)?