From 8ee8db5f928e4861ae13ab3cba5d414a8fb900a2 Mon Sep 17 00:00:00 2001
From: wangershi <33387561+wangershi@users.noreply.github.com>
Date: Tue, 5 Jun 2018 14:02:39 +0000
Subject: [PATCH] Add code.

Use exhaustive test to solve the function, a little fun.
---
 C01-The-Role-of-Algorithms-in-Computing/1.2.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/C01-The-Role-of-Algorithms-in-Computing/1.2.md b/C01-The-Role-of-Algorithms-in-Computing/1.2.md
index c8bf5f8a..35c50295 100644
--- a/C01-The-Role-of-Algorithms-in-Computing/1.2.md
+++ b/C01-The-Role-of-Algorithms-in-Computing/1.2.md
@@ -22,6 +22,8 @@ Suppose we are comparing implementations of insertion sort and merge sort on the
 
 for 2 < n < 43
 
+[code](./exercise_code/exercise-1.2-2.cpp)
+
 
 ### Exercises 1.2-3
 ***
@@ -32,6 +34,7 @@ than an algorithm whose running time is ![](http://latex.codecogs.com/gif.latex?
 还是解方程 ![](http://latex.codecogs.com/gif.latex?100n^2=2^n)
 
 for n = 15
+[code](./exercise_code/exercise-1.2-3.cpp)
 
 ***
 Follow [@louis1992](https://github.com/gzc) on github to help finish this task.