What is the time complexity of the following code used to convert a decimal number to its binary equivalent?
Posted: Wed Jul 13, 2022 7:40 pm
#include<stdio.h>
void dec_to_bin(int n)
{
int arr[31],len = 0,i;
if(n == 0)
{
arr[0] = 0;
len = 1;
}
while(n != 0)
{
arr[len++] = n % 2;
n /= 2;
}
for(i=len-1; i>=0; i--)
printf("%d",arr);
}
int main()
{
int n = 0;
dec_to_bin(n);
return 0;
}
a) O(1)
b) O(n)
c) O(n2)
d) O(logn)
void dec_to_bin(int n)
{
int arr[31],len = 0,i;
if(n == 0)
{
arr[0] = 0;
len = 1;
}
while(n != 0)
{
arr[len++] = n % 2;
n /= 2;
}
for(i=len-1; i>=0; i--)
printf("%d",arr);
}
int main()
{
int n = 0;
dec_to_bin(n);
return 0;
}
a) O(1)
b) O(n)
c) O(n2)
d) O(logn)