OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Resolve typo errors

Browse Source
This commit is contained in:
Mann Mehta 2020-04-04 18:16:40 +05:30
parent a82e679f2e
commit 8219e124a7
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
math/binary_exponent.cpp
View File

@ -31,7 +31,7 @@ int binExpo(int a, int b) {
/// Iterative function to calculate exponent in O(log(n)) using binary exponent. /// Iterative function to calculate exponent in O(log(n)) using binary exponent.
int binExpo_alt(int a, int b) { int binExpo_alt(int a, int b) {
int res = 1; int res = 1;
while (b>0) { while (b > 0) {
if (b%2) { if (b%2) {
res = res*a; res = res*a;
} }
@ -45,9 +45,9 @@ int main() {
int a, b; int a, b;
/// Give two numbers a, b /// Give two numbers a, b
std::cin >> a >> b; std::cin >> a >> b;
if (a==0 && b==0) { if (a == 0 && b == 0) {
std::cout << "Math error" << std::endl; std::cout << "Math error" << std::endl;
} else if (b<0) { } else if (b < 0) {
std::cout << "Exponent must be positive !!" << std::endl; std::cout << "Exponent must be positive !!" << std::endl;
} else { } else {
int resRecurse = binExpo(a, b); int resRecurse = binExpo(a, b);