[MATH-1181] KolmogorovSmirnov test algorithm choice prone to integer overflow

• Type: Bug
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Affects Version/s: 3.3
• Fix Version/s: 3.4
• Assignee: Unassigned
• Reporter: Phil Steitz
• Created: 15/Dec/14 13:09
• Updated: 26/Dec/14 19:50
• Resolved: 15/Dec/14 13:50

Description

The computation used to select the algorithm in the 2-sample KS test is prone to integer overflow, resulting in the "exact" method being chosen for very large samples, resulting in impractically long execution time.