-
-
Notifications
You must be signed in to change notification settings - Fork 798
/
Copy pathDivideUsingSubtraction.java
70 lines (66 loc) · 2.46 KB
/
DivideUsingSubtraction.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
* Copyright (C) 2014 Pedro Vicente Gómez Sánchez.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.github.pedrovgs.problem5;
/**
* Given two integers passed as parameter, can you write a method to divide the division of that
* parameters using subtraction operator?
*
* @author Pedro Vicente Gómez Sánchez.
*/
public class DivideUsingSubtraction {
/**
* This algorithm is based on the mathematical property related with the division where a
* division es a continuous subtraction.
*
* In space terms, the complexity of this algorithm is O(1) because we are not using any
* additional data structure. In time terms, the complexity of this algorithm is O(N) where N is
* the number of times you can subtract the divider to the dividend.
*/
public float divideIterative(int dividend, int divider) {
validateInput(divider);
float result = 0;
while (dividend > divider) {
dividend -= divider;
result++;
}
float decimalPart = (float) dividend / (float) divider;
result += decimalPart;
return result;
}
/**
* Recursive version of the previous algorithm .The complexity order in space and memory terms is
* the same than the iterative version. However this algorithm is more expensive in computation
* terms because recursion is going to add a new frame to the stack every time a recursive call
* is performed. Review this algorithm and take into account this algorithm is not tail
* recursive.
*/
public float divideRecursive(int dividend, int divider) {
validateInput(divider);
if (dividend == 0) {
return 0f;
} else if (dividend < divider) {
return (float) dividend / (float) divider;
} else {
return 1f + divideRecursive(dividend - divider, divider);
}
}
private void validateInput(int divider) {
if (divider == 0) {
throw new IllegalArgumentException(
"You can't divide using 0 as divider. That operation is not defined");
}
}
}