Anonymous user
Closest-pair problem: Difference between revisions
→{{header|D}}
Line 211:
=={{header|D}}==
D version 2 implementation,
<lang d>import std.stdio,std.typecons,std.math,std.algorithm,std.array,std.random;
Line 288:
Time gave 0:06.28 elapsed for brute force, and 0:00.07 elapsed for the divide & conquer one (10_000 points).
A
<lang d>import std.stdio, std.typecons, std.math, std.random;
|