The K$-$Means algorithm complexity tends to be linear with respect to the number of data points, number of

clusters selected $($K$)$ and number of features $(n)$ provided that the data is amenable to be segmented in groups

of similar instances $($clustering$).$

True

False