?
Solved

Algorithm

Posted on 1998-06-08
3
Medium Priority
?
362 Views
Last Modified: 2010-04-01
What is the best algorithm to check a number is in which particular range of:
0 to 9
10 to 99
100 to 999
1000 to 9999
10000 to 99999
...rate at exponential of 10

E.g X = 555 is in the range of 100 - 999

I use a if-else-then to do the checking but its looks terribly ugly.

Any advice?
0
Comment
Question by:engllf
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
3 Comments
 
LVL 23

Accepted Solution

by:
chensu earned 100 total points
ID: 1165459
Which is the best depends on the actual requirements. Here is an alternative. But you still need to check the value of n. You may use n as an index of an array.


#include <math.h>

.

if (X >= 0)
{
    unsigned int n = X == 0 ? 0 : log10((double)X);
    // 0 to 9, n = 0
    // 10 to 99, n = 1
    // 100 to 999, n = 2
    // 1000 to 9999, n = 3
    // ...
}
else
{
   ...
}

0
 
LVL 4

Expert Comment

by:sganta
ID: 1165460


      I have simple and beautiful algorithm and solution for your problem.

      ALGORITHM
      1. Read the number into "n";
      2. Store this number n as a string into test
          i.e., test = string(n);
      3. Get the length of the string into length
          length = string_length(n);
      4. Now
          Range_From = power(10,length-1)
          Range_To     = power(10,length)-1
      5. End of the algorithm

      /* Here the solution in C++ */

      #include <iostream.h>
      #include <string.h>
      #include <math.h>

      void main(void)
      {
         int n,len,ifrom,ito;
         char *test;

         cout << "Enter a number ";
         cin >>n;

         test = itoa(n); /* Converts integer to Ascii */
         len = strlen(test);
         ifrom = pow(10,len-1);
         ito = pow(10,len)-1;
         cout << "The number "<<n<<" is in the range from "<<ifrom<<" to "<<ito<<endl;
      }

      This  algorithm is tested and it works fine. If you are interested with my answer
      Please reject the above answer and accept my answer.
      Thank you.
      JESUS LOVES YOU - sganta





0
 
LVL 22

Expert Comment

by:nietod
ID: 1165461
engllf, just so you know, while sganta's solution is pretty short and very slick, it is not very efficient.  If you are concerned about speed, you'll want to use chensu's solution.  But if you aren't concerned about speed, sganta's solution is pretty clear and simple.
0

Featured Post

Free Tool: IP Lookup

Get more info about an IP address or domain name, such as organization, abuse contacts and geolocation.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

In days of old, returning something by value from a function in C++ was necessarily avoided because it would, invariably, involve one or even two copies of the object being created and potentially costly calls to a copy-constructor and destructor. A…
Often, when implementing a feature, you won't know how certain events should be handled at the point where they occur and you'd rather defer to the user of your function or class. For example, a XML parser will extract a tag from the source code, wh…
The goal of the video will be to teach the user the concept of local variables and scope. An example of a locally defined variable will be given as well as an explanation of what scope is in C++. The local variable and concept of scope will be relat…
The viewer will learn how to user default arguments when defining functions. This method of defining functions will be contrasted with the non-default-argument of defining functions.
Suggested Courses
Course of the Month13 days, 11 hours left to enroll

801 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question