Merge pull request #146 from ashwek/master

Reduced Lines of code
This commit is contained in:
Ashwek Swamy
2019-02-09 15:55:43 +05:30
committed by GitHub
2 changed files with 17 additions and 39 deletions

View File

@@ -1,12 +1,12 @@
#include<iostream>
using namespace std;
int stack[10];
int top=0;
int *stack;
int top=0, size;
void push(int x)
{
if(top==10)
if(top==size)
{
cout<<"\nOverflow";
}
@@ -42,6 +42,9 @@ void topmost()
}
int main()
{
cout<<"\nEnter Size of stack : ";
cin>>size;
stack = new int[size];
int ch, x;
do
{

View File

@@ -2,50 +2,25 @@
using namespace std;
void main(void)
{
int main(void){
int valueToConvert = 0; //Holds user input
int hexArray[8]; //Contains hex values backwards
int i = 0; //counter
int lValue = 0; //Last Value of Hex result
char HexValues[] = "0123456789ABCDEF";
cout << "Enter a Decimal Value" << endl; //Displays request to stdout
cin >> valueToConvert; //Stores value into valueToConvert via user input
while (valueToConvert > 0) //Dec to Hex Algorithm
{
lValue = valueToConvert % 16; //Gets remainder
valueToConvert = valueToConvert / 16;
hexArray[i] = lValue; //Stores converted values into an array
i++;
while (valueToConvert > 15){ //Dec to Hex Algorithm
hexArray[i++] = valueToConvert % 16; //Gets remainder
valueToConvert /= 16;
}
hexArray[i] = valueToConvert; //Gets last value
cout << "Hex Value: ";
while (i > 0)
{
//Displays Hex Letters to stdout
switch (hexArray[i - 1]) {
case 10:
cout << "A";
break;
case 11:
cout << "B";
break;
case 12:
cout << "C";
break;
case 13:
cout << "D";
break;
case 14:
cout << "E";
break;
case 15:
cout << "F";
break;
default:
cout << hexArray[i - 1]; //if not an int 10 - 15, displays int value
}
i--;
}
while (i >= 0)
cout<<HexValues[hexArray[i--]];
cout << endl;
return 0;
}