explanation about the recursive Euclid algo to find GCD

Author: anishsingh20

Data Structures/Stacks/InfixToPostfix.cpp

@@ -35,7 +35,7 @@ string InfixToPostfix(string exp)
 		//pop all with higher precedence
 		// push low precedence into stack
 		else if(isOperator(exp[i])) {
-			while(!S.empty() && S.top()!='(' && checkHighPrecedence(S.top(),exp[i])) {
+			while(!S.empty() && S.top()!='(' && checkHighPrecedence(S.top(),exp[i]) ) {
 				postfix += S.top(); //add higher precedence opt to postfix expression
 				S.pop(); //pop higher precedence opt from stack	
 			}

General Programs/GCD.cpp

@@ -43,7 +43,7 @@ long int GCDRecur(long long int a ,long long int b)
 
 	 } 
 
-	 cout<<"NUmber of operations to find GCD are "<< count<<endl;
+	cout<<"NUmber of operations to find GCD are "<< count<<endl;
 
 	return a;
 
@@ -83,7 +83,7 @@ long long int EuclidGCDRecursive(long long int a,long long int b)
 	if(a!=b)
 	{
 
-		
+		//replace the larger of 2 no(s) by the dfference between it and the smaller number
 		if(a > b)
 			return EuclidGCDRecursive(a-b,b);