David Eisenstat questions

David Eisenstat answers

• Monte Carlo integration to find pi with a certain precision in FORTRAN
• What is the best & worst time complexity Of KMP algorithm
• set with average O(1) for add/remove and worst max/min O(log n)
• Chu-Liu Edmond's algorithm for Minimum Spanning Tree on Directed Graphs
• Efficient sum of expensive rolling window products
• What is the difference between divide and conquer, and branch and reduce?
• What is the most efficient algorithm for solving the cell-sum puzzle?
• Where to start when proving correctness of algorithms
• Construct infinite sorted list without adding duplicates
• Calculating the Recurrence Relation T(n)=T(n-1)+logn