forked from HarshCasper/NeoAlgo
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Binary_Exponentiation.dart
76 lines (59 loc) · 1.37 KB
/
Binary_Exponentiation.dart
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
71
72
73
74
75
76
/*
* Dart Program to find Binary Exponent Iteratively and Recursively.
* Here we calculate a^b using two different methods: iteratively and recursively
*/
import 'dart:io';
// Iterative function to calculate exponent.
int binExpo_iterate(int a, int b) {
int res = 1;
while (b > 0) {
if (b % 2 != 0) {
res = res * a;
}
a = a * a;
b = (b / 2).floor();
}
return res;
}
// Recursive function to calculate exponent.
int binExpo_recurse(int a, int b) {
if (b == 0) {
return 1;
}
int res = binExpo_recurse(a, (b / 2).floor());
if (b % 2 != 0) {
return res * res * a;
} else {
return res * res;
}
}
// Main function
void main() {
print("Lets calculate Binary Exponent a^b");
print("Enter a");
int a = int.parse(stdin.readLineSync()!);
print("Enter b");
int b = int.parse(stdin.readLineSync()!);
if (a == 0 && b == 0) {
print("Math Error");
} else if (b < 0) {
print("Exponent must be Positive");
} else {
int resIterate = binExpo_iterate(a, b);
int resRecurse = binExpo_recurse(a, b);
print("a^b calculated iteratively: $resIterate");
print("a^b calculated recursively: $resRecurse");
}
}
/**
Sample Input and Output :
Lets calculate Binary Exponent a^b
Enter a
3
Enter b
5
a^b calculated iteratively: 243
a^b calculated recursively: 243
Time complexity = O(n)
Space complexity = O(1)
*/