Commit 4538a2ce authored by will's avatar will

ASSESSMENT ONE

parent 7805f22d
Pipeline #562 failed with stages
...@@ -7,28 +7,22 @@ public class AssessmentPartOne { ...@@ -7,28 +7,22 @@ public class AssessmentPartOne {
// Debug this method so it passes the unit test. // Debug this method so it passes the unit test.
// Add comments beside any changes you make // Add comments beside any changes you make
if (num1<num2) if((num1 > num2) && (num1 > num3))
{
if (num3>num1)
{
return num3;
}
else
{ {
return num1; return num1;
//this if statement says that if num1 is greater than num2 AND num1 is greater than
//num3 - return value num1
} }
} else if((num2 > num1) && (num2 > num3 ))
else
{
if (num3>num2)
{
return num3;
}
else
{ {
return num2 return num2;
} //however if that isn't correct, this checks to see whether num2 is greater than
//num1 AND num2 is greater than num3 - and so returns num2 if all is correct
} }
else return num3;
//if both of these conditions are false - then return num3
} }
public int sumNumbersBetween(int start, int end) public int sumNumbersBetween(int start, int end)
...@@ -43,7 +37,21 @@ public class AssessmentPartOne { ...@@ -43,7 +37,21 @@ public class AssessmentPartOne {
// You should comment your code explaining what each part does // You should comment your code explaining what each part does
int sumOfSquares = 0; int sumOfSquares = 0;
if ((start >=0) && (end >=0) && (start<end) && (end > start+1))
//condition to compare if start and end are integer variables
//also comparing that start is smaller than end
//and last comparing that there are existing integer numbers between both
//variables to add together
{
for (int i= start +1;i<end; i++)
{
//after the conditions above are true, then using the loop we can add all
//the numbers between start and end without counting them.
sumOfSquares=sumOfSquares+i;
}
}
else return -1;
//if all these conditions are false and cannot calculate result - then the return value is -1.
return sumOfSquares; return sumOfSquares;
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment