David Eisenstat questions

David Eisenstat answers

• How is shell sort algorithm any better than of merge sort algorithm?
• Integer Programming for NNC
• Optimal solution for tree traversal and summing node values on condition
• Finding cycles with a single differently colored edge in a colored graph
• Time complexity for Dijkstra's algorithm with min heap and optimizations
• O(n*log(n)) Turing Machine with exactly 1 tape for "equal number of a's and b's in a given word"?
• Good compression scheme for continued fraction terms?
• Longest Profitable Trade Algorithm
• Finding Cycles in Graphs Using Depth-First Search
• Number of even XOR-ed subarrays