i.e., will the algorithm always return the same result (for a 1D list of numbers)? Is Fisher's Natural Breaks (the O(knlog(n)) optimization of Jenks') deterministic?
i.e., will the algorithm always return the same result (for a 1D list of numbers)? Is Fisher's Natural Breaks (the O(knlog(n)) optimization of Jenks') deterministic?