More redable format of V1

Author: darshangouda

BaseConversionAlgorithm V2.cpp

@@ -0,0 +1,302 @@
+#include<iostream>
+#include<string.h>
+#include<stdio.h>
+#include<stdlib.h>
+#include<fstream>
+#include<ctime>
+
+using namespace std;
+
+char DIGITS[]  = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";;
+
+const long int size1 = 1000000;
+char inputString[size1 * 2];
+
+// ---------------------------
+// Renamed arrays
+// ---------------------------
+unsigned int integerWork[size1]   = {0};
+unsigned int fractionWork[size1]  = {0};
+unsigned int fractionOut[size1]   = {0};
+
+// --------------------------------------------------
+void dis(long int n, long int f = -1, long int k1 = 0, long int num = 0)
+{
+    long int k;
+
+    if (k1 != 0 && num != 0)
+        cout << k1 << "-" << n+1 << "-|";
+
+    for (k = n; k >= 0; k--)
+        cout << DIGITS[ integerWork[k] ];
+
+    // Only print fractional part if f >= 0 (meaning some fractional digits were produced)
+    if (f >= 0 && !(f == 0 && fractionOut[0] == 0))
+    {
+        cout << ".";
+        for (k = 0; k <= f; k++)
+            cout << DIGITS[ fractionOut[k] ];
+    }
+    cout << endl;
+}
+// --------------------------------------------------
+
+int main()
+{
+    fstream input, output;
+    clock_t start;
+    double duration;
+
+    long int rows = size1, trows;
+    long int i, j, k, p;
+
+    long int o, m = 0, m1 = 0, l;
+
+    long int base1, base2, maxDigitBase2;
+    long int integerInputLen = 0;
+    long int fractionInputLen = 0;
+
+    long int highestIntPos;
+    long int fracLen;            // will hold final fractional length (can be -1 if none)
+
+    long int fractionLimit = 100;
+
+    int choice = 0, temp, numtemp;
+    int save, value = 0;
+
+    long int intLenProcessed, carryIndex;
+
+    base1 = 10;
+    base2 = 16;
+
+    maxDigitBase2 = base2 - 1;
+    trows = rows;
+    save = 0;
+
+begining:
+
+    rows = trows;
+
+    // clear buffers
+    for (p = 0; p < rows; p++)
+    {
+        inputString[p] = 0;
+        integerWork[p] = 0;
+        fractionWork[p] = 0;
+        fractionOut[p] = 0;
+    }
+
+    cout << "________________________________________________________________________________________________________________" << endl;
+    cout << "                 DATA REPRESENTATION" << endl;
+
+    cout << "1.CONVERT A (BASE1=" << base1 << ") TO (BASE2=" << base2 << ") \n ( FRACTION LIMIT =" << fractionLimit << "   SAVE OUTPUT=";
+    if (save == 1) cout << "YES" << endl;
+    else           cout << "NO"  << endl;
+
+    cout << "2.CHANGE THE BASE , FRACTION LIMIT & SAVING OUTPUT?" << endl;
+    cout << "3.CLEAR SCREEN " << endl;
+    cout << "4.HELP " << endl;
+    cout << "5.EXIT " << endl;
+    cout << "ENTER YOUR CHOICE = ";
+    cin >> choice;
+
+    if (choice == 1)
+        goto case1_start;
+    else if (choice == 2)
+    {
+        cout << "BASE1 = ";
+        cin >> base1;
+        cout << "BASE2 = ";
+        cin >> base2;
+        cout << "FRACTION LIMIT = ";
+        cin >> fractionLimit;
+        cout << "SAVE OUTPUT (1=YES 0=NO) = ";
+        cin >> save;
+        goto begining;
+    }
+    else if (choice == 3)
+    {
+        system("cls");
+        goto begining;
+    }
+    else if (choice == 4)
+    {
+        cout << " *.OUTPUT SAVED IN \"output.txt\" IF ENABLED.\n";
+        cout << " *.INPUT FOR FILE MODE MUST BE IN \"input.txt\"\n";
+        goto begining;
+    }
+    else if (choice == 5)
+    {
+        exit(0);
+    }
+    else
+    {
+        cout << "INVALID CHOICE\n";
+        goto begining;
+    }
+
+case1_start:
+
+    cout << "      1.INPUT CONSOLE   2.INPUT FILE\nENTER = ";
+    cin >> choice;
+
+    if (choice == 1)
+    {
+        cout << "ENTER NUMBER (base" << base1 << "): "<<endl;
+        cin >> inputString;
+    }
+    else if (choice == 2)
+    {
+        input.open("input.txt", ios::in);
+        input >> inputString;
+        cout << inputString << endl;
+        input.close();
+    }
+    else
+    {
+        cout << "INVALID\n";
+        goto case1_start;
+    }
+
+    integerInputLen = strlen(inputString);
+    cout << "LENGTH = " << integerInputLen << endl;
+
+    if (integerInputLen > (long)sizeof(inputString))
+    {
+        cout << "STRING SIZE LIMIT = " << sizeof(inputString) << endl;
+        goto case1_start;
+    }
+
+    // find decimal point
+    for (p = 0; p < integerInputLen; p++)
+        if (inputString[p] == '.')
+            break;
+
+    // convert ASCII to numeric (in-place)
+    for (i = 0; i < integerInputLen; i++)
+    {
+        if (inputString[i] > 57)  // A-F etc
+            inputString[i] -= 7;
+        inputString[i] -= 48;     // '0'
+    }
+
+    // copy fraction part reverse into fractionWork[]
+    k = 0;
+    for (i = integerInputLen - 1; i > p; i--)
+        fractionWork[k++] = inputString[i];
+
+    cout << "please wait(processing...)" << endl;
+
+    start = std::clock();
+
+    fractionInputLen = integerInputLen - p;
+    integerInputLen  = p;
+
+    carryIndex = 0;
+    fracLen = -1;
+    intLenProcessed = 1;
+
+    // ---------------------------------------------------
+    // INTEGER PART CONVERSION
+    // ---------------------------------------------------
+    for (k = 0; k < integerInputLen; k++)
+    {
+        for (p = 0; (integerWork[p] *= base1), p < intLenProcessed; p++) {}
+
+        integerWork[0] += inputString[k];
+
+        for (i = 0; i < intLenProcessed; i++)
+        {
+            long int idx = i;
+
+            while (integerWork[idx] > maxDigitBase2)
+            {
+                if (carryIndex < idx) carryIndex = idx;
+                integerWork[idx+1] += integerWork[idx] / base2;
+                integerWork[idx]   %= base2;
+                idx++;
+            }
+        }
+
+        intLenProcessed = carryIndex + 2;
+    }
+
+    // ---------------------------------------------------
+    // FRACTIONAL PART
+    // ---------------------------------------------------
+    long int fractionResultIndex = -1;
+    bool fractionNotZero = true;
+
+    // Only run fractional loop if there was a fractional part in the input
+    if (fractionInputLen > 0)
+    {
+        do
+        {
+            for (p = 0; p < fractionInputLen; p++)
+            {
+                fractionWork[p] *= base2;
+            }
+            for (i = 0; i < fractionInputLen - 1; i++)
+            {
+                fractionWork[i + 1] += fractionWork[i] / base1;
+                fractionWork[i] %= base1;
+            }
+
+            // store extracted digit
+            fractionOut[++fractionResultIndex] = fractionWork[fractionInputLen - 1];
+
+            // CORRECT: clear working buffer (not fractionOut)
+            fractionWork[fractionInputLen - 1] = 0;
+
+            fractionNotZero = false;
+            for (p = 0; p < fractionInputLen; p++)
+            {
+                if (fractionWork[p] != 0)
+                {
+                    fractionNotZero = true;
+                    break;
+                }
+            }
+        }
+        while (fractionNotZero && fractionResultIndex < fractionLimit - 1);
+    }
+
+    // set final fracLen to produced index (can be -1 if no fraction produced)
+    fracLen = fractionResultIndex;
+
+    duration = (std::clock() - start) / (double) CLOCKS_PER_SEC;
+
+    highestIntPos = 0;
+    for (p = 0; p < rows; p++)
+        if (integerWork[p] > 0)
+            highestIntPos = p;
+
+    cout << endl << "EQUIVALENT TO (base)" << base2 << endl;
+    dis(highestIntPos, fracLen);
+
+    if (save == 1)
+    {
+        for (i = 0; i < integerInputLen; i++)
+            inputString[i] = 0;
+
+        p = 0;
+        for (i = highestIntPos; i >= 0; i--)
+            inputString[p++] = DIGITS[ integerWork[i] ];
+
+        if (!(fracLen == 0 && fractionOut[0] == 0) && fracLen >= 0)
+        {
+            inputString[p++] = '.';
+            for (k = 0; k <= fracLen; k++)
+                inputString[p++] = DIGITS[ fractionOut[k] ];
+        }
+
+        output.open("output.txt", ios::out);
+        output << inputString;
+        output.close();
+    }
+
+    cout << "TIME TAKEN = " << duration << endl;
+    goto begining;
+
+    return 0;
+}