Skip to content

SimpleMathService.java completed #109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
volkovartiam wants to merge 1 commit into
base: master
Choose a base branch
from
Open

SimpleMathService.java completed #109

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
106 changes: 96 additions & 10 deletions src/main/java/com/epam/izh/rd/online/service/SimpleMathService.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,17 @@ public class SimpleMathService implements MathService {
*/
@Override
public int compare(int value1, int value2) {
return -2;
int returnValue = -2;
if (value1==value2) {
returnValue = 0;
}
if (value1<value2) {
returnValue = -1;
}
if (value1>value2) {
returnValue = 1;
}
return returnValue;
}

/**
Expand All @@ -22,7 +32,10 @@ public int compare(int value1, int value2) {
*/
@Override
public int maxFrom(int value1, int value2) {
return -1;
if(value1<=value2) {
value1=value2;
}
return value1;
}

/**
Expand All @@ -31,7 +44,13 @@ public int maxFrom(int value1, int value2) {
*/
@Override
public int maxFrom(int[] values) {
return -1;
int max = values[0];
for(int i=1;i<values.length;i++) {
if(max < values[i]){
max = values[i];
}
}
return max;
}

/**
Expand All @@ -40,7 +59,11 @@ public int maxFrom(int[] values) {
*/
@Override
public int sum(int[] values) {
return -1;
int sum = 0;
for (int i =0; i<values.length ; i++){
sum = sum + values[i];
}
return sum;
}

/**
Expand All @@ -49,7 +72,21 @@ public int sum(int[] values) {
*/
@Override
public int[] getEvenDigits(int[] values) {
return new int[]{};
int numberOfEven = 0;
for (int i = 0; i < values.length; i++){
if(values[i]%2 == 0) {
numberOfEven++;
}
}
int[] even = new int[numberOfEven];
int temp = 0;
for (int i = 0; i < values.length; i++){
if(values[i]%2 == 0) {
even[temp] = values[i];
temp++;
}
}
return even;
}

/**
Expand All @@ -59,7 +96,13 @@ public int[] getEvenDigits(int[] values) {
*/
@Override
public long calcFactorial(int initialVal) {
return -1L;
int fact = 1;
int temp = 0;
while (initialVal>1) {
fact = fact*initialVal;
initialVal--;
}
return fact;
}

/**
Expand All @@ -74,7 +117,13 @@ public long calcFactorial(int initialVal) {
*/
@Override
public long calcFibonacci(int number) {
return -1L;
int[] fibo = new int[number + 2];
fibo[0] = 0;
fibo[1] = 1;
for(int i=2; i<=number; i++) {
fibo[i]=fibo[i-1] + fibo[i-2];
}
return fibo[number];
}

/**
Expand All @@ -83,7 +132,23 @@ public long calcFibonacci(int number) {
*/
@Override
public int[] sort(int[] values) {
return new int[]{};
int[] sort = new int[values.length];

if (values.length > 0) {
for(int i = 0; i < values.length; i++) {
sort[i] = values[i];
}
for(int i = 0; i < sort.length; i++) {
for(int j = i+1; j < sort.length; j++) {
if(sort[j] < sort[i] ) {
int tempMin = sort[j];
sort[j] = sort[i];
sort[i] = tempMin;
}
}
}
}
return sort;
}

/**
Expand All @@ -94,7 +159,17 @@ public int[] sort(int[] values) {
*/
@Override
public boolean isPrimary(int number) {
return false;
boolean isPrimary = true;

if (number > 3){
for(int i = number-1; i > 1; i--) {
if (number%i == 0) {
isPrimary = false;
i = 0;
}
}
}
return isPrimary;
}

/**
Expand All @@ -104,6 +179,17 @@ public boolean isPrimary(int number) {
*/
@Override
public int[] reverseArray(int[] values) {
return new int[]{};
int[] reverseArr = new int[values.length];

if (values.length > 0) {
int j = 0;
for(int i = values.length -1 ; i >= 0; i--) {
reverseArr[j] = values[i];
j++;
}
}

return reverseArr;

}
}