Previous | Next --- Slide 22 of 49
Back to Lecture Thumbnails
silentQ

This question reminds me of the k-means clustering problem (which is NP-complete). Could an algorithm like that one be used here?

https://en.wikipedia.org/wiki/K-means_clustering

djevans

Huh, that sounds like a good idea. This could then be used for deciding which data structure to use.