Hello, I have written a full fledged efficient implementation of cKMeans in Java https://cran.r-project.org/web/packages/Ckmeans.1d.dp/index.html and https://journal.r-project.org/archive/2011-2/RJournal_2011-2_Wang+Song.pdf
The algorithm described here is *O(kn^2)* where *k*: number of clusters and *n*: number of 1D points. But, there exists an efficient implementation in later versions of cKMeans which is *O(knlog(n))* cKMeans is faster than kMeans and also deterministic in nature. Can I submit a patch request for cKMeans implementation in Apache Commons Math3 ML Clustering <https://commons.apache.org/proper/commons-math/javadocs/api-3.6/org/apache/commons/math3/ml/clustering/package-summary.html> package as a contribution? Thanks Shubham Jindal
