From 033059103d93309d67fd4de63a00136704e1edf5 Mon Sep 17 00:00:00 2001
From: Andrew Pardoe <apardoe@microsoft.com>
Date: Fri, 25 Sep 2015 11:16:51 -0700
Subject: [PATCH] Add fix from issue #122

---
 CppCoreGuidelines.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CppCoreGuidelines.md b/CppCoreGuidelines.md
index 3493973..13ecdfe 100644
--- a/CppCoreGuidelines.md
+++ b/CppCoreGuidelines.md
@@ -1775,7 +1775,7 @@ You could use cyclomatic complexity. Try "more that 10 logical path through." Co
 	constexpr int fac(int n)
 	{
 		constexpr int max_exp = 17;     // constexpr enables  this to be used in Expects
-		Expects(0<=x && x<max_exp);		// prevent silliness and overflow
+		Expects(0<=n && n<max_exp);		// prevent silliness and overflow
 		int x = 1;
 		for (int i=2; i<=n; ++i) x*= n;
 		return x;