updated example

tsung-wei-huang · tsung-wei-huang · commit f8dae8e0133a · 2018-09-13T18:45:36.000-05:00
diff --git a/example/taskflow_subsum.cpp b/example/taskflow_subsum.cpp
@@ -1,3 +1,7 @@
+// 2018/09/13 - created by Chun-Xun Lin
+//
+// This example is from https://www.geeksforgeeks.org/divide-and-conquer-maximum-sum-subarray/
+
 #include <climits>
 
 #include <taskflow/taskflow.hpp>  // the only include you need
@@ -37,7 +41,7 @@ int maxCrossingSum(std::vector<int>& vec, int l, int m, int r){
   return left_sum + right_sum; 
 } 
 
-// This example is from https://www.geeksforgeeks.org/divide-and-conquer-maximum-sum-subarray/
+
 template<typename T>
 void maxSubArraySum(std::vector<int>& vec, int l, int r, std::atomic<int>& max_num, T& subflow) 
 { 

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,7 @@`
	`1`	`+// 2018/09/13 - created by Chun-Xun Lin`
	`2`	`+//`
	`3`	`+// This example is from https://www.geeksforgeeks.org/divide-and-conquer-maximum-sum-subarray/`
	`4`	`+`
`1`	`5`	`#include <climits>`
`2`	`6`
`3`	`7`	`#include <taskflow/taskflow.hpp> // the only include you need`
`@@ -37,7 +41,7 @@ int maxCrossingSum(std::vector<int>& vec, int l, int m, int r){`
`37`	`41`	`return left_sum + right_sum;`
`38`	`42`	`}`
`39`	`43`
`40`		`-// This example is from https://www.geeksforgeeks.org/divide-and-conquer-maximum-sum-subarray/`
	`44`	`+`
`41`	`45`	`template<typename T>`
`42`	`46`	`void maxSubArraySum(std::vector<int>& vec, int l, int r, std::atomic<int>& max_num, T& subflow)`
`43`	`47`	`{`