So this post is just to show a different approach to convert binary to decimal.
I would like the community to make this code better in terms of complexity. If possible ππ
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int n;
cin >> n;
int count=0;
int sum =0;
for(int i=n;i>0;i=i/10)
{
int rem = i%10;
if(rem==0)
{
count =count +1;
continue;
}
else if(rem==1)
sum = sum + pow(2,count);
count =count+1;
}
cout << sum <<endl;
}
Time Complexity : O(log n)
Correct me guys if I'm wrong!
Thanks.....
Top comments (0)