[+/-] : Covert Decimal to Octal In C++

This snippet has a will convert Decimal number to Octal number.

// coverts decimal to ocal
// vishesh
// 21/05/2005

#include 

char* DEC_OCT(int);

int main()
{
 //
 int num;
 std::cout << "Enter a number: ";
 std::cin   >> num;
 std::cout << DEC_OCT(num);
 std::cin.get();
 return 0;
}

char* DEC_OCT(int dec)
{
 using namespace std;

 char *rtn;

 int prev, len, temp, *OCT;
 
 prev = dec;
 
 for(int i=0;prev!=0;i++)
 { 
  prev = prev/8;
  len=i;
 }

 OCT = new int[len+1];

 prev = dec;

 for(int i=0;prev!=0;i++)
 {
  OCT[i] = prev%8;
  prev = prev/8;
  len=i;
 }

 OCT[len+1] = prev%8;
 len++;

 for(int i=0;i<len/2;i++)
 {
  temp=OCT[i];
  OCT[i]=OCT[len-1-i];
  OCT[len-1-i]=temp;
 }

 rtn = new char[len+1];
 
 for(int i=0;i<len;i++)
 {
  rtn[i]=OCT[i]+'0';
  rtn[i+1]='\0';
 }
 
 return rtn;
}

...
Read more

[+/-] : This snippet has a will convert Decimal number to Binary number In C++

This snippet has a will convert Decimal number to Binary number.

// coverts decimal to binary
// vishesh
// 21/05/2005

#include 

char* DEC_BIN(int);

int main()
{
 //
 int num;
 std::cout << "Enter a number: ";
 std::cin   >> num;
 std::cout << DEC_BIN(num);
 std::cin.get();
 return 0;
}

char* DEC_BIN(int dec)
{
 using namespace std;

 char *rtn;

 int prev, len, temp, *bin;
 
 prev = dec;
 
 for(int i=0;prev!=0;i++)
 { 
  prev = prev/2;
  len=i;
 }

 bin = new int[len+1];

 prev = dec;

 for(int i=0;prev!=0;i++)
 {
  bin[i] = prev%2;
  prev = prev/2;
  len=i;
 }

 bin[len+1] = prev%2;
 len++;

 for(int i=0;i < len/2;i++)
 {
  temp=bin[i];
  bin[i]=bin[len-1-i];
  bin[len-1-i]=temp;
 }

 rtn = new char[len+1];
 
 for(int i=0;i<len;i++)
 {
  rtn[i]=bin[i]+'0';
  rtn[i+1]='\0';
 }
 
 return rtn;
}

...
Read more

[+/-] : Implementing String trimming (Ltrim and Rtrim) in C

Here is a simple implementation of implementing a simple Left trim (ltrim) and Right trim(rtim) of unwanted characters from a C style string. (null terminated strings). Doesn't suffer the overheads of the memmove implementation in which the worst case scenario (a string containing all junk characters) is approx. N^2 / 2.

#include 

char* rtrim(char* string, char junk);
char* ltrim(char* string, char junk);

int main()
{
    char testStr1[] = "     We like helping out people          ";
    char testStr2[] = "     We like helping out people          ";
    char testStr3[] = "     We like helping out people          ";
    printf("|%s|", testStr1);
    printf("\n|%s|", ltrim(testStr1, ' '));
    printf("\n\n|%s|", testStr2);
    printf("\n\n|%s|", rtrim(testStr2, ' '));
    printf("\n\n|%s|", testStr3);
    printf("\n|%s|", ltrim(rtrim(testStr3, ' '), ' '));
    getchar();
    return 0;
}


char* rtrim(char* string, char junk)
{
    char* original = string + strlen(string);
    while(*--original == junk);
    *(original + 1) = '\0';
    return string;
}

char* ltrim(char *string, char junk)
{
    char* original = string;
    char *p = original;
    int trimmed = 0;
    do
    {
        if (*original != junk || trimmed)
        {
            trimmed = 1;
            *p++ = *original;
        }
    }
    while (*original++ != '\0');
    return string;
}
/*

|     We like helping out people          |
|We like helping out people          |

|     We like helping out people          |

|     We like helping out people|

|     We like helping out people          |
|We like helping out people|

 */

...
Read more