Compute a recursive algorithm in parallel using Task
问题 how do I convert this sequential recursive algorithm into a parallel recursive algorithm using tasks? public static List<int> s = new List<int>(); // random integers, array size is n public static List<int> p = new List<int>(); // random integers, array size is n public static int n = 100; public static int w = 10; static void Main(string[] args) { G1(n, w) } private static int G1(int k, int r) { if (k == 0 || r == 0) { return 0; } if (s[k - 1] > r) { return G1(k - 1, r); } return Math.Max(G1