C/C++ Solving Error in C++ Digit Algorithm Program

  • Thread starter Thread starter chaoseverlasting
  • Start date Start date
  • Tags Tags
    Algorithm C++
Click For Summary
The discussion revolves around a programming issue where the user is trying to determine the number of digits in an integer using the log function in C++. The primary concern is that the log function computes the natural logarithm, which is not suitable for counting digits. Instead, it is suggested to use the log10 function for base 10 logarithms, but even that is not the most efficient method. A more effective approach is proposed: repeatedly divide the integer by 10 until it reaches zero, which accurately counts the digits for all integer sizes, including negative integers. This method is highlighted as being faster and more reliable than using log or sprintf functions. The conversation also touches on alternative methods like using itoa and strlen for counting digits, but the division method is favored for its simplicity and efficiency.
chaoseverlasting
Messages
1,050
Reaction score
3
I wrote a program to find the number of digits of an integer, but I always get the wrong result. Could someone point out the error? Here's the source code:

#include <iostream>
#include <cmath>

using namespace std;

int main()
{
int i=53443;
cout<<log(i);
return 0;
}


The log function gives me a weird result each time. I don't know why though. I am using dev c++ compiler...
 
Technology news on Phys.org
The log function computes the natural logarithm.
 
man log10
 
Is this homework? I don't want to go much further with help if it is.
 
This isn't homework. I am trying to write a program which needs this bit. I can't seem to figure this out. So is it log(e) or log (10) ?
 
If that's it (the natural log- base 10 difference), I can figure the rest out. Is there perhaps some property of integers and the way this function works (the taylor series of log(1+x) maybe?) that's causing this?
 
RTFM, or as Borek said, man log10 (and man log won't hurt). If you are not on a UNIX machine, there is always the internet. What does log() compute?

BTW, neither log() nor log10() is really what you want. Will this approach work on negative integers or on 64 bit (long long) integers?
 
Personally I'd use sprintf & count the characters in the buffer...
 
Since this is not homework, I will give my solution. Keep dividing by ten (the integer, not the double) until the result becomes zero. This works for all sizes of integers, negative integers, is much faster and more accurate than using log10(), and is much, much faster than sprintf.
Code:
int ndigits = 0;
for (same_int_type_as_i rem = i; rem != 0; rem /= 10) {
   ++ndigits;
}
 
  • #10
When I went to bed yesterday I thought of strlen(itoa(abs(i))) but I am not addicted to the web enough to post such things immediately :wink: This is similar to sprintf, just much easier to code.
 
  • #11
Borek said:
When I went to bed yesterday I thought of strlen(itoa(abs(i))) but I am not addicted to the web enough to post such things immediately :wink: This is similar to sprintf, just much easier to code.

D H said:
Since this is not homework, I will give my solution. Keep dividing by ten (the integer, not the double) until the result becomes zero. This works for all sizes of integers, negative integers, is much faster and more accurate than using log10(), and is much, much faster than sprintf.
Code:
int ndigits = 0;
for (same_int_type_as_i rem = i; rem != 0; rem /= 10) {
   ++ndigits;
}

Thank you. :cool: That helps :cool:.
 

Similar threads

  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 40 ·
2
Replies
40
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 15 ·
Replies
15
Views
4K
  • · Replies 39 ·
2
Replies
39
Views
5K
Replies
12
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
12
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K