Update 1.1.md

Author: alexanderdickson

C01-The-Role-of-Algorithms-in-Computing/1.1.md

@@ -32,7 +32,7 @@ How are the shortest-path and traveling-salesman problems given above similar? H
 * 相同点：都是在图中找一条路径
 * 不同点：最短路径只是求2个点之间的路径，但是旅行商问题要遍历全部点并且回到起点，是一个全排列问题.
 * In travelling salesman problem we want to know an order of delivery of stops that yields "lowest overall distance" travelled .
-* This "lowese overall distance" is similar to shortest path finding situation .
+* This "lowest overall distance" is similar to shortest path finding situation .
 * Shortest path is polynomially solvable but travelling -salesman is NP-Complete
 
 ### Exercises 1.1-5